./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 TOGETHER --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 TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 13:48:04,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 13:48:04,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 13:48:04,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 13:48:04,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 13:48:04,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 13:48:04,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 13:48:04,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 13:48:04,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 13:48:04,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 13:48:04,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 13:48:04,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 13:48:04,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 13:48:04,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 13:48:04,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 13:48:04,910 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 13:48:04,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 13:48:04,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 13:48:04,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 13:48:04,915 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 13:48:04,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 13:48:04,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 13:48:04,919 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 13:48:04,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 13:48:04,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 13:48:04,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 13:48:04,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 13:48:04,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 13:48:04,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 13:48:04,930 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 13:48:04,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 13:48:04,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 13:48:04,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 13:48:04,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 13:48:04,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 13:48:04,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 13:48:04,936 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 13:48:04,936 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 13:48:04,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 13:48:04,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 13:48:04,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 13:48:04,938 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-08-30 13:48:04,961 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 13:48:04,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 13:48:04,962 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 13:48:04,962 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 13:48:04,963 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 13:48:04,963 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 13:48:04,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 13:48:04,964 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 13:48:04,964 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 13:48:04,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 13:48:04,965 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 13:48:04,965 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 13:48:04,965 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 13:48:04,965 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 13:48:04,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 13:48:04,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 13:48:04,966 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 13:48:04,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 13:48:04,966 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-08-30 13:48:04,966 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 13:48:04,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 13:48:04,966 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 13:48:04,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 13:48:04,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 13:48:04,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 13:48:04,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 13:48:04,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 13:48:04,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 13:48:04,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 13:48:04,967 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 13:48:04,967 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 13:48:04,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 13:48:04,968 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 13:48:04,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 13:48:04,968 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 13:48:04,968 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 13:48:04,969 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 13:48:04,969 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 -> TOGETHER [2023-08-30 13:48:05,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 13:48:05,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 13:48:05,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 13:48:05,250 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 13:48:05,250 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 13:48:05,251 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 13:48:06,258 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 13:48:06,517 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 13:48:06,518 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_05-funloop_hard2.i [2023-08-30 13:48:06,542 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1777791a/999550428b514100952f2a5db118e8bb/FLAG88be2b078 [2023-08-30 13:48:06,554 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1777791a/999550428b514100952f2a5db118e8bb [2023-08-30 13:48:06,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 13:48:06,558 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 13:48:06,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 13:48:06,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 13:48:06,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 13:48:06,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 01:48:06" (1/1) ... [2023-08-30 13:48:06,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f37068e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:48:06, skipping insertion in model container [2023-08-30 13:48:06,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 01:48:06" (1/1) ... [2023-08-30 13:48:06,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 13:48:06,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 13:48:06,939 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 13:48:06,958 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 13:48:07,009 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 13:48:07,057 INFO L208 MainTranslator]: Completed translation [2023-08-30 13:48:07,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:48:07 WrapperNode [2023-08-30 13:48:07,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 13:48:07,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 13:48:07,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 13:48:07,059 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 13:48:07,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:48:07" (1/1) ... [2023-08-30 13:48:07,088 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:48:07" (1/1) ... [2023-08-30 13:48:07,113 INFO L138 Inliner]: procedures = 262, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2023-08-30 13:48:07,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 13:48:07,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 13:48:07,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 13:48:07,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 13:48:07,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:48:07" (1/1) ... [2023-08-30 13:48:07,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:48:07" (1/1) ... [2023-08-30 13:48:07,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:48:07" (1/1) ... [2023-08-30 13:48:07,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:48:07" (1/1) ... [2023-08-30 13:48:07,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:48:07" (1/1) ... [2023-08-30 13:48:07,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:48:07" (1/1) ... [2023-08-30 13:48:07,142 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:48:07" (1/1) ... [2023-08-30 13:48:07,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:48:07" (1/1) ... [2023-08-30 13:48:07,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 13:48:07,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 13:48:07,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 13:48:07,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 13:48:07,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:48:07" (1/1) ... [2023-08-30 13:48:07,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 13:48:07,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:48:07,202 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 13:48:07,234 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 13:48:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 13:48:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 13:48:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 13:48:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 13:48:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 13:48:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 13:48:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-30 13:48:07,249 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-30 13:48:07,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 13:48:07,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 13:48:07,250 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 13:48:07,352 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 13:48:07,354 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 13:48:07,577 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 13:48:07,584 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 13:48:07,585 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-30 13:48:07,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 01:48:07 BoogieIcfgContainer [2023-08-30 13:48:07,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 13:48:07,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 13:48:07,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 13:48:07,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 13:48:07,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 01:48:06" (1/3) ... [2023-08-30 13:48:07,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d49dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 01:48:07, skipping insertion in model container [2023-08-30 13:48:07,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:48:07" (2/3) ... [2023-08-30 13:48:07,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d49dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 01:48:07, skipping insertion in model container [2023-08-30 13:48:07,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 01:48:07" (3/3) ... [2023-08-30 13:48:07,593 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_05-funloop_hard2.i [2023-08-30 13:48:07,598 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 13:48:07,604 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 13:48:07,604 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-08-30 13:48:07,604 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 13:48:07,637 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 13:48:07,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 104 transitions, 213 flow [2023-08-30 13:48:07,683 INFO L130 PetriNetUnfolder]: 6/103 cut-off events. [2023-08-30 13:48:07,683 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 13:48:07,688 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 13:48:07,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 104 transitions, 213 flow [2023-08-30 13:48:07,690 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 103 transitions, 209 flow [2023-08-30 13:48:07,692 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 13:48:07,698 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 103 transitions, 209 flow [2023-08-30 13:48:07,700 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 103 transitions, 209 flow [2023-08-30 13:48:07,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 103 transitions, 209 flow [2023-08-30 13:48:07,714 INFO L130 PetriNetUnfolder]: 6/103 cut-off events. [2023-08-30 13:48:07,714 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 13:48:07,718 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 13:48:07,719 INFO L119 LiptonReduction]: Number of co-enabled transitions 2852 [2023-08-30 13:48:09,227 INFO L134 LiptonReduction]: Checked pairs total: 3603 [2023-08-30 13:48:09,228 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-08-30 13:48:09,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 13:48:09,245 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;@4d59d0a6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 13:48:09,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-08-30 13:48:09,247 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2023-08-30 13:48:09,248 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 13:48:09,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:09,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 13:48:09,249 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 13:48:09,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:09,254 INFO L85 PathProgramCache]: Analyzing trace with hash 12550, now seen corresponding path program 1 times [2023-08-30 13:48:09,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:09,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460303530] [2023-08-30 13:48:09,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:09,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:09,415 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 13:48:09,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:09,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460303530] [2023-08-30 13:48:09,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460303530] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:09,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:09,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 13:48:09,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320660944] [2023-08-30 13:48:09,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:09,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 13:48:09,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:09,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 13:48:09,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 13:48:09,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 200 [2023-08-30 13:48:09,458 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 13:48:09,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:09,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 200 [2023-08-30 13:48:09,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:09,529 INFO L130 PetriNetUnfolder]: 152/306 cut-off events. [2023-08-30 13:48:09,529 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 13:48:09,530 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 13:48:09,532 INFO L137 encePairwiseOnDemand]: 195/200 looper letters, 29 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-08-30 13:48:09,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 127 flow [2023-08-30 13:48:09,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 13:48:09,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 13:48:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-08-30 13:48:09,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5383333333333333 [2023-08-30 13:48:09,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-08-30 13:48:09,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-08-30 13:48:09,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:09,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-08-30 13:48:09,546 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 13:48:09,549 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 13:48:09,550 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 13:48:09,551 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 65 flow. Second operand 3 states and 323 transitions. [2023-08-30 13:48:09,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 127 flow [2023-08-30 13:48:09,552 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 13:48:09,553 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 76 flow [2023-08-30 13:48:09,554 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 13:48:09,556 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2023-08-30 13:48:09,556 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 76 flow [2023-08-30 13:48:09,557 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 13:48:09,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:09,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 13:48:09,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 13:48:09,557 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 13:48:09,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:09,558 INFO L85 PathProgramCache]: Analyzing trace with hash 390006, now seen corresponding path program 1 times [2023-08-30 13:48:09,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:09,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338334336] [2023-08-30 13:48:09,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:09,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:09,622 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 13:48:09,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:09,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338334336] [2023-08-30 13:48:09,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338334336] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:48:09,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353033038] [2023-08-30 13:48:09,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:09,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:48:09,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:48:09,645 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 13:48:09,646 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 13:48:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:09,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 13:48:09,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:48:09,749 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 13:48:09,750 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 13:48:09,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353033038] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:09,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 13:48:09,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2023-08-30 13:48:09,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990168499] [2023-08-30 13:48:09,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:09,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 13:48:09,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:09,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 13:48:09,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 13:48:09,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 200 [2023-08-30 13:48:09,777 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 13:48:09,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:09,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 200 [2023-08-30 13:48:09,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:09,832 INFO L130 PetriNetUnfolder]: 152/305 cut-off events. [2023-08-30 13:48:09,833 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 13:48:09,833 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 13:48:09,834 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 28 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-08-30 13:48:09,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 132 flow [2023-08-30 13:48:09,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 13:48:09,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 13:48:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 415 transitions. [2023-08-30 13:48:09,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51875 [2023-08-30 13:48:09,843 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 415 transitions. [2023-08-30 13:48:09,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 415 transitions. [2023-08-30 13:48:09,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:09,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 415 transitions. [2023-08-30 13:48:09,844 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 13:48:09,846 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 13:48:09,846 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 13:48:09,846 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 76 flow. Second operand 4 states and 415 transitions. [2023-08-30 13:48:09,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 132 flow [2023-08-30 13:48:09,847 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 13:48:09,847 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 72 flow [2023-08-30 13:48:09,848 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 13:48:09,848 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2023-08-30 13:48:09,848 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 72 flow [2023-08-30 13:48:09,849 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 13:48:09,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:09,849 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:09,861 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 13:48:10,053 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 13:48:10,054 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 13:48:10,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:10,054 INFO L85 PathProgramCache]: Analyzing trace with hash -573546742, now seen corresponding path program 1 times [2023-08-30 13:48:10,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:10,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089335119] [2023-08-30 13:48:10,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:10,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 13:48:10,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:10,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089335119] [2023-08-30 13:48:10,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089335119] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:48:10,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653131346] [2023-08-30 13:48:10,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:10,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:48:10,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:48:10,121 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 13:48:10,143 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 13:48:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:10,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 13:48:10,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:48:10,210 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 13:48:10,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:48:10,223 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 13:48:10,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653131346] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:48:10,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:48:10,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 13:48:10,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138587418] [2023-08-30 13:48:10,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:48:10,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 13:48:10,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:10,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 13:48:10,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 13:48:10,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 200 [2023-08-30 13:48:10,245 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 13:48:10,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:10,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 200 [2023-08-30 13:48:10,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:10,350 INFO L130 PetriNetUnfolder]: 152/308 cut-off events. [2023-08-30 13:48:10,351 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 13:48:10,352 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 13:48:10,354 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 28 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2023-08-30 13:48:10,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 150 flow [2023-08-30 13:48:10,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 13:48:10,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 13:48:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2023-08-30 13:48:10,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505 [2023-08-30 13:48:10,358 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 606 transitions. [2023-08-30 13:48:10,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions. [2023-08-30 13:48:10,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:10,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions. [2023-08-30 13:48:10,360 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 13:48:10,363 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 13:48:10,363 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 13:48:10,363 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 72 flow. Second operand 6 states and 606 transitions. [2023-08-30 13:48:10,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 150 flow [2023-08-30 13:48:10,364 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 13:48:10,365 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 105 flow [2023-08-30 13:48:10,365 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 13:48:10,366 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2023-08-30 13:48:10,366 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 105 flow [2023-08-30 13:48:10,366 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 13:48:10,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:10,367 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:10,375 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 13:48:10,571 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 13:48:10,573 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 13:48:10,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:10,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1594330982, now seen corresponding path program 2 times [2023-08-30 13:48:10,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:10,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965562144] [2023-08-30 13:48:10,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:10,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:10,662 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 13:48:10,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:10,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965562144] [2023-08-30 13:48:10,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965562144] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:48:10,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915852754] [2023-08-30 13:48:10,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 13:48:10,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:48:10,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:48:10,664 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 13:48:10,666 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 13:48:10,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 13:48:10,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 13:48:10,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 13:48:10,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:48:10,733 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 13:48:10,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:48:10,780 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 13:48:10,805 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 13:48:10,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 13:48:10,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915852754] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:10,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 13:48:10,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2023-08-30 13:48:10,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609685809] [2023-08-30 13:48:10,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:10,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 13:48:10,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:10,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 13:48:10,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-30 13:48:10,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 200 [2023-08-30 13:48:10,846 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 13:48:10,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:10,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 200 [2023-08-30 13:48:10,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:10,956 INFO L130 PetriNetUnfolder]: 196/391 cut-off events. [2023-08-30 13:48:10,956 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 13:48:10,957 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 13:48:10,958 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 49 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2023-08-30 13:48:10,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 263 flow [2023-08-30 13:48:10,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 13:48:10,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 13:48:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 426 transitions. [2023-08-30 13:48:10,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5325 [2023-08-30 13:48:10,960 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 426 transitions. [2023-08-30 13:48:10,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 426 transitions. [2023-08-30 13:48:10,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:10,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 426 transitions. [2023-08-30 13:48:10,961 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 13:48:10,962 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 13:48:10,963 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 13:48:10,963 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 105 flow. Second operand 4 states and 426 transitions. [2023-08-30 13:48:10,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 263 flow [2023-08-30 13:48:10,964 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 13:48:10,965 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 145 flow [2023-08-30 13:48:10,965 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 13:48:10,965 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-08-30 13:48:10,965 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 145 flow [2023-08-30 13:48:10,966 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 13:48:10,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:10,966 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:10,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-30 13:48:11,169 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 13:48:11,170 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 13:48:11,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:11,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1594329890, now seen corresponding path program 1 times [2023-08-30 13:48:11,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:11,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031283709] [2023-08-30 13:48:11,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:11,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:11,266 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 13:48:11,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:11,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031283709] [2023-08-30 13:48:11,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031283709] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:48:11,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772224981] [2023-08-30 13:48:11,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:11,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:48:11,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:48:11,282 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 13:48:11,285 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 13:48:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:11,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 13:48:11,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:48:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 13:48:11,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:48:11,401 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 13:48:11,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772224981] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:48:11,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:48:11,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-30 13:48:11,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146007312] [2023-08-30 13:48:11,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:48:11,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 13:48:11,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:11,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 13:48:11,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-30 13:48:11,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 200 [2023-08-30 13:48:11,440 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 13:48:11,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:11,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 200 [2023-08-30 13:48:11,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:11,517 INFO L130 PetriNetUnfolder]: 196/397 cut-off events. [2023-08-30 13:48:11,517 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2023-08-30 13:48:11,519 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 13:48:11,520 INFO L137 encePairwiseOnDemand]: 197/200 looper letters, 34 selfloop transitions, 11 changer transitions 0/45 dead transitions. [2023-08-30 13:48:11,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 271 flow [2023-08-30 13:48:11,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 13:48:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 13:48:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1185 transitions. [2023-08-30 13:48:11,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49375 [2023-08-30 13:48:11,523 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1185 transitions. [2023-08-30 13:48:11,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1185 transitions. [2023-08-30 13:48:11,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:11,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1185 transitions. [2023-08-30 13:48:11,525 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 13:48:11,528 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 13:48:11,529 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 13:48:11,529 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 145 flow. Second operand 12 states and 1185 transitions. [2023-08-30 13:48:11,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 271 flow [2023-08-30 13:48:11,533 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 13:48:11,534 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 229 flow [2023-08-30 13:48:11,534 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 13:48:11,536 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 29 predicate places. [2023-08-30 13:48:11,536 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 229 flow [2023-08-30 13:48:11,538 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 13:48:11,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:11,538 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:11,554 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 13:48:11,742 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 13:48:11,742 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 13:48:11,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:11,743 INFO L85 PathProgramCache]: Analyzing trace with hash 90496734, now seen corresponding path program 2 times [2023-08-30 13:48:11,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:11,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607455070] [2023-08-30 13:48:11,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:11,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:11,927 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 13:48:11,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:11,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607455070] [2023-08-30 13:48:11,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607455070] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:11,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:11,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 13:48:11,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586550151] [2023-08-30 13:48:11,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:11,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 13:48:11,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:11,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 13:48:11,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 13:48:11,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 200 [2023-08-30 13:48:11,961 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 13:48:11,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:11,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 200 [2023-08-30 13:48:11,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:12,036 INFO L130 PetriNetUnfolder]: 186/377 cut-off events. [2023-08-30 13:48:12,037 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2023-08-30 13:48:12,038 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 13:48:12,039 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 50 selfloop transitions, 8 changer transitions 0/58 dead transitions. [2023-08-30 13:48:12,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 378 flow [2023-08-30 13:48:12,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 13:48:12,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 13:48:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 416 transitions. [2023-08-30 13:48:12,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52 [2023-08-30 13:48:12,040 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 416 transitions. [2023-08-30 13:48:12,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 416 transitions. [2023-08-30 13:48:12,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:12,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 416 transitions. [2023-08-30 13:48:12,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:48:12,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:48:12,042 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 13:48:12,043 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 229 flow. Second operand 4 states and 416 transitions. [2023-08-30 13:48:12,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 378 flow [2023-08-30 13:48:12,044 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 13:48:12,045 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 219 flow [2023-08-30 13:48:12,045 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 13:48:12,046 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 29 predicate places. [2023-08-30 13:48:12,046 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 219 flow [2023-08-30 13:48:12,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:48:12,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:12,046 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:12,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 13:48:12,047 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 13:48:12,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:12,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1066976044, now seen corresponding path program 1 times [2023-08-30 13:48:12,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:12,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478825346] [2023-08-30 13:48:12,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:12,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:12,081 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:48:12,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:12,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478825346] [2023-08-30 13:48:12,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478825346] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:12,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:12,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 13:48:12,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258137346] [2023-08-30 13:48:12,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:12,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 13:48:12,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:12,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 13:48:12,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 13:48:12,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 200 [2023-08-30 13:48:12,093 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 13:48:12,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:12,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 200 [2023-08-30 13:48:12,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:12,184 INFO L130 PetriNetUnfolder]: 264/534 cut-off events. [2023-08-30 13:48:12,184 INFO L131 PetriNetUnfolder]: For 184/184 co-relation queries the response was YES. [2023-08-30 13:48:12,184 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 13:48:12,186 INFO L137 encePairwiseOnDemand]: 195/200 looper letters, 69 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2023-08-30 13:48:12,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 71 transitions, 451 flow [2023-08-30 13:48:12,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 13:48:12,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 13:48:12,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-08-30 13:48:12,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5683333333333334 [2023-08-30 13:48:12,187 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-08-30 13:48:12,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-08-30 13:48:12,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:12,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-08-30 13:48:12,188 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 13:48:12,188 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 13:48:12,189 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 13:48:12,189 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 219 flow. Second operand 3 states and 341 transitions. [2023-08-30 13:48:12,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 71 transitions, 451 flow [2023-08-30 13:48:12,190 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 13:48:12,191 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 228 flow [2023-08-30 13:48:12,191 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 13:48:12,192 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 31 predicate places. [2023-08-30 13:48:12,192 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 228 flow [2023-08-30 13:48:12,192 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 13:48:12,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:12,192 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:12,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 13:48:12,192 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 13:48:12,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:12,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1068025261, now seen corresponding path program 1 times [2023-08-30 13:48:12,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:12,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216801300] [2023-08-30 13:48:12,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:12,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:12,230 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 13:48:12,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:12,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216801300] [2023-08-30 13:48:12,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216801300] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:12,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:12,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 13:48:12,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014551250] [2023-08-30 13:48:12,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:12,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 13:48:12,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:12,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 13:48:12,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 13:48:12,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 200 [2023-08-30 13:48:12,238 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 13:48:12,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:12,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 200 [2023-08-30 13:48:12,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:12,323 INFO L130 PetriNetUnfolder]: 318/646 cut-off events. [2023-08-30 13:48:12,323 INFO L131 PetriNetUnfolder]: For 311/311 co-relation queries the response was YES. [2023-08-30 13:48:12,324 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 13:48:12,326 INFO L137 encePairwiseOnDemand]: 195/200 looper letters, 63 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-30 13:48:12,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 421 flow [2023-08-30 13:48:12,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 13:48:12,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 13:48:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-08-30 13:48:12,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.555 [2023-08-30 13:48:12,327 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-08-30 13:48:12,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-08-30 13:48:12,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:12,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-08-30 13:48:12,328 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 13:48:12,328 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 13:48:12,329 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 13:48:12,329 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 228 flow. Second operand 3 states and 333 transitions. [2023-08-30 13:48:12,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 421 flow [2023-08-30 13:48:12,330 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 13:48:12,330 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 226 flow [2023-08-30 13:48:12,330 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 13:48:12,331 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 33 predicate places. [2023-08-30 13:48:12,331 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 226 flow [2023-08-30 13:48:12,331 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 13:48:12,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:12,331 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:12,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 13:48:12,331 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 13:48:12,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:12,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1132939076, now seen corresponding path program 1 times [2023-08-30 13:48:12,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:12,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459027962] [2023-08-30 13:48:12,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:12,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:12,548 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 13:48:12,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:12,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459027962] [2023-08-30 13:48:12,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459027962] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:12,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:12,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 13:48:12,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245134310] [2023-08-30 13:48:12,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:12,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 13:48:12,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:12,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 13:48:12,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 13:48:12,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-08-30 13:48:12,659 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 13:48:12,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:12,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-08-30 13:48:12,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:12,886 INFO L130 PetriNetUnfolder]: 354/736 cut-off events. [2023-08-30 13:48:12,886 INFO L131 PetriNetUnfolder]: For 349/349 co-relation queries the response was YES. [2023-08-30 13:48:12,887 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 13:48:12,890 INFO L137 encePairwiseOnDemand]: 190/200 looper letters, 66 selfloop transitions, 17 changer transitions 0/83 dead transitions. [2023-08-30 13:48:12,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 83 transitions, 532 flow [2023-08-30 13:48:12,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 13:48:12,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 13:48:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 759 transitions. [2023-08-30 13:48:12,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.474375 [2023-08-30 13:48:12,892 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 759 transitions. [2023-08-30 13:48:12,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 759 transitions. [2023-08-30 13:48:12,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:12,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 759 transitions. [2023-08-30 13:48:12,895 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 13:48:12,897 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 13:48:12,897 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 13:48:12,897 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 226 flow. Second operand 8 states and 759 transitions. [2023-08-30 13:48:12,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 83 transitions, 532 flow [2023-08-30 13:48:12,899 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 13:48:12,900 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 355 flow [2023-08-30 13:48:12,900 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 13:48:12,901 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2023-08-30 13:48:12,901 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 355 flow [2023-08-30 13:48:12,901 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 13:48:12,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:12,902 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:12,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 13:48:12,902 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 13:48:12,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:12,902 INFO L85 PathProgramCache]: Analyzing trace with hash -436636914, now seen corresponding path program 1 times [2023-08-30 13:48:12,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:12,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552753067] [2023-08-30 13:48:12,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:12,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:13,169 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 13:48:13,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:13,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552753067] [2023-08-30 13:48:13,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552753067] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:13,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:13,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 13:48:13,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224537806] [2023-08-30 13:48:13,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:13,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 13:48:13,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:13,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 13:48:13,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 13:48:13,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-08-30 13:48:13,302 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 13:48:13,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:13,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-08-30 13:48:13,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:13,604 INFO L130 PetriNetUnfolder]: 381/816 cut-off events. [2023-08-30 13:48:13,604 INFO L131 PetriNetUnfolder]: For 1072/1072 co-relation queries the response was YES. [2023-08-30 13:48:13,605 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 13:48:13,608 INFO L137 encePairwiseOnDemand]: 190/200 looper letters, 69 selfloop transitions, 29 changer transitions 0/98 dead transitions. [2023-08-30 13:48:13,608 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 98 transitions, 752 flow [2023-08-30 13:48:13,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 13:48:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 13:48:13,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1011 transitions. [2023-08-30 13:48:13,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45954545454545453 [2023-08-30 13:48:13,621 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1011 transitions. [2023-08-30 13:48:13,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1011 transitions. [2023-08-30 13:48:13,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:13,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1011 transitions. [2023-08-30 13:48:13,623 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 13:48:13,625 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 13:48:13,626 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 13:48:13,626 INFO L175 Difference]: Start difference. First operand has 76 places, 58 transitions, 355 flow. Second operand 11 states and 1011 transitions. [2023-08-30 13:48:13,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 98 transitions, 752 flow [2023-08-30 13:48:13,628 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 13:48:13,629 INFO L231 Difference]: Finished difference. Result has 88 places, 72 transitions, 538 flow [2023-08-30 13:48:13,629 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 13:48:13,630 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 56 predicate places. [2023-08-30 13:48:13,630 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 72 transitions, 538 flow [2023-08-30 13:48:13,630 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 13:48:13,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:13,630 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:13,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 13:48:13,631 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 13:48:13,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:13,631 INFO L85 PathProgramCache]: Analyzing trace with hash -436723406, now seen corresponding path program 2 times [2023-08-30 13:48:13,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:13,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392460744] [2023-08-30 13:48:13,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:13,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:13,851 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 13:48:13,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:13,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392460744] [2023-08-30 13:48:13,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392460744] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:13,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:13,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 13:48:13,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375057486] [2023-08-30 13:48:13,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:13,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 13:48:13,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:13,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 13:48:13,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 13:48:13,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-08-30 13:48:13,967 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 13:48:13,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:13,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-08-30 13:48:13,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:14,221 INFO L130 PetriNetUnfolder]: 400/853 cut-off events. [2023-08-30 13:48:14,221 INFO L131 PetriNetUnfolder]: For 2246/2246 co-relation queries the response was YES. [2023-08-30 13:48:14,222 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 13:48:14,225 INFO L137 encePairwiseOnDemand]: 190/200 looper letters, 76 selfloop transitions, 25 changer transitions 0/101 dead transitions. [2023-08-30 13:48:14,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 101 transitions, 878 flow [2023-08-30 13:48:14,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 13:48:14,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 13:48:14,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 934 transitions. [2023-08-30 13:48:14,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.467 [2023-08-30 13:48:14,228 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 934 transitions. [2023-08-30 13:48:14,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 934 transitions. [2023-08-30 13:48:14,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:14,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 934 transitions. [2023-08-30 13:48:14,229 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 13:48:14,231 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 13:48:14,231 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 13:48:14,232 INFO L175 Difference]: Start difference. First operand has 88 places, 72 transitions, 538 flow. Second operand 10 states and 934 transitions. [2023-08-30 13:48:14,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 101 transitions, 878 flow [2023-08-30 13:48:14,236 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 13:48:14,237 INFO L231 Difference]: Finished difference. Result has 95 places, 77 transitions, 616 flow [2023-08-30 13:48:14,237 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 13:48:14,237 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 63 predicate places. [2023-08-30 13:48:14,237 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 77 transitions, 616 flow [2023-08-30 13:48:14,238 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 13:48:14,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:14,238 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:14,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 13:48:14,238 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 13:48:14,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:14,238 INFO L85 PathProgramCache]: Analyzing trace with hash -436704804, now seen corresponding path program 2 times [2023-08-30 13:48:14,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:14,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175275197] [2023-08-30 13:48:14,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:14,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:14,416 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 13:48:14,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:14,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175275197] [2023-08-30 13:48:14,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175275197] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:14,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:14,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 13:48:14,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926726923] [2023-08-30 13:48:14,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:14,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 13:48:14,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:14,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 13:48:14,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-30 13:48:14,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-08-30 13:48:14,521 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 13:48:14,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:14,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-08-30 13:48:14,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:14,795 INFO L130 PetriNetUnfolder]: 437/923 cut-off events. [2023-08-30 13:48:14,795 INFO L131 PetriNetUnfolder]: For 3149/3149 co-relation queries the response was YES. [2023-08-30 13:48:14,796 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 13:48:14,799 INFO L137 encePairwiseOnDemand]: 190/200 looper letters, 86 selfloop transitions, 40 changer transitions 0/126 dead transitions. [2023-08-30 13:48:14,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 126 transitions, 1122 flow [2023-08-30 13:48:14,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 13:48:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 13:48:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1027 transitions. [2023-08-30 13:48:14,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4668181818181818 [2023-08-30 13:48:14,802 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1027 transitions. [2023-08-30 13:48:14,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1027 transitions. [2023-08-30 13:48:14,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:14,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1027 transitions. [2023-08-30 13:48:14,803 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 13:48:14,806 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 13:48:14,806 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 13:48:14,806 INFO L175 Difference]: Start difference. First operand has 95 places, 77 transitions, 616 flow. Second operand 11 states and 1027 transitions. [2023-08-30 13:48:14,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 126 transitions, 1122 flow [2023-08-30 13:48:14,812 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 13:48:14,813 INFO L231 Difference]: Finished difference. Result has 101 places, 86 transitions, 789 flow [2023-08-30 13:48:14,813 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 13:48:14,813 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 69 predicate places. [2023-08-30 13:48:14,814 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 86 transitions, 789 flow [2023-08-30 13:48:14,814 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 13:48:14,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:14,814 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:14,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 13:48:14,814 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 13:48:14,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:14,815 INFO L85 PathProgramCache]: Analyzing trace with hash -436704806, now seen corresponding path program 3 times [2023-08-30 13:48:14,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:14,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616396077] [2023-08-30 13:48:14,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:14,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:15,037 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 13:48:15,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:15,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616396077] [2023-08-30 13:48:15,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616396077] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:15,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:15,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 13:48:15,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430479096] [2023-08-30 13:48:15,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:15,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 13:48:15,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:15,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 13:48:15,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-30 13:48:15,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-08-30 13:48:15,134 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 13:48:15,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:15,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-08-30 13:48:15,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:15,376 INFO L130 PetriNetUnfolder]: 408/874 cut-off events. [2023-08-30 13:48:15,377 INFO L131 PetriNetUnfolder]: For 4142/4142 co-relation queries the response was YES. [2023-08-30 13:48:15,378 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 13:48:15,382 INFO L137 encePairwiseOnDemand]: 190/200 looper letters, 82 selfloop transitions, 40 changer transitions 0/122 dead transitions. [2023-08-30 13:48:15,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 122 transitions, 1173 flow [2023-08-30 13:48:15,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 13:48:15,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 13:48:15,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1035 transitions. [2023-08-30 13:48:15,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47045454545454546 [2023-08-30 13:48:15,385 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1035 transitions. [2023-08-30 13:48:15,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1035 transitions. [2023-08-30 13:48:15,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:15,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1035 transitions. [2023-08-30 13:48:15,387 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 13:48:15,391 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 13:48:15,391 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 13:48:15,391 INFO L175 Difference]: Start difference. First operand has 101 places, 86 transitions, 789 flow. Second operand 11 states and 1035 transitions. [2023-08-30 13:48:15,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 122 transitions, 1173 flow [2023-08-30 13:48:15,399 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 13:48:15,401 INFO L231 Difference]: Finished difference. Result has 104 places, 84 transitions, 744 flow [2023-08-30 13:48:15,401 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 13:48:15,401 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 72 predicate places. [2023-08-30 13:48:15,401 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 84 transitions, 744 flow [2023-08-30 13:48:15,402 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 13:48:15,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:15,402 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:15,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 13:48:15,402 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 13:48:15,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:15,403 INFO L85 PathProgramCache]: Analyzing trace with hash -436729940, now seen corresponding path program 1 times [2023-08-30 13:48:15,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:15,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387531222] [2023-08-30 13:48:15,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:15,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:15,584 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 13:48:15,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:15,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387531222] [2023-08-30 13:48:15,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387531222] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:15,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:15,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 13:48:15,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362582960] [2023-08-30 13:48:15,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:15,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 13:48:15,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:15,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 13:48:15,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 13:48:15,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-08-30 13:48:15,697 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 13:48:15,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:15,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-08-30 13:48:15,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:15,942 INFO L130 PetriNetUnfolder]: 429/929 cut-off events. [2023-08-30 13:48:15,942 INFO L131 PetriNetUnfolder]: For 4043/4043 co-relation queries the response was YES. [2023-08-30 13:48:15,944 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 13:48:15,948 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 89 selfloop transitions, 29 changer transitions 0/118 dead transitions. [2023-08-30 13:48:15,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 118 transitions, 1235 flow [2023-08-30 13:48:15,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 13:48:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 13:48:15,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 754 transitions. [2023-08-30 13:48:15,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47125 [2023-08-30 13:48:15,951 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 754 transitions. [2023-08-30 13:48:15,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 754 transitions. [2023-08-30 13:48:15,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:15,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 754 transitions. [2023-08-30 13:48:15,952 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 13:48:15,954 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 13:48:15,954 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 13:48:15,954 INFO L175 Difference]: Start difference. First operand has 104 places, 84 transitions, 744 flow. Second operand 8 states and 754 transitions. [2023-08-30 13:48:15,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 118 transitions, 1235 flow [2023-08-30 13:48:15,961 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 13:48:15,963 INFO L231 Difference]: Finished difference. Result has 107 places, 98 transitions, 946 flow [2023-08-30 13:48:15,963 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 13:48:15,963 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 75 predicate places. [2023-08-30 13:48:15,963 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 98 transitions, 946 flow [2023-08-30 13:48:15,964 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 13:48:15,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:15,964 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:15,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 13:48:15,964 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 13:48:15,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:15,964 INFO L85 PathProgramCache]: Analyzing trace with hash -436729951, now seen corresponding path program 1 times [2023-08-30 13:48:15,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:15,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62079807] [2023-08-30 13:48:15,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:15,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:16,124 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 13:48:16,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:16,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62079807] [2023-08-30 13:48:16,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62079807] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:16,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:16,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 13:48:16,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36703289] [2023-08-30 13:48:16,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:16,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 13:48:16,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:16,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 13:48:16,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 13:48:16,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-08-30 13:48:16,222 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 13:48:16,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:16,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-08-30 13:48:16,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:16,460 INFO L130 PetriNetUnfolder]: 422/940 cut-off events. [2023-08-30 13:48:16,460 INFO L131 PetriNetUnfolder]: For 4829/4829 co-relation queries the response was YES. [2023-08-30 13:48:16,463 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 13:48:16,467 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 94 selfloop transitions, 32 changer transitions 0/126 dead transitions. [2023-08-30 13:48:16,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 126 transitions, 1420 flow [2023-08-30 13:48:16,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 13:48:16,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 13:48:16,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 834 transitions. [2023-08-30 13:48:16,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4633333333333333 [2023-08-30 13:48:16,469 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 834 transitions. [2023-08-30 13:48:16,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 834 transitions. [2023-08-30 13:48:16,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:16,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 834 transitions. [2023-08-30 13:48:16,471 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 13:48:16,473 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 13:48:16,473 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 13:48:16,473 INFO L175 Difference]: Start difference. First operand has 107 places, 98 transitions, 946 flow. Second operand 9 states and 834 transitions. [2023-08-30 13:48:16,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 126 transitions, 1420 flow [2023-08-30 13:48:16,481 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 13:48:16,483 INFO L231 Difference]: Finished difference. Result has 114 places, 105 transitions, 1097 flow [2023-08-30 13:48:16,483 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 13:48:16,483 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 82 predicate places. [2023-08-30 13:48:16,483 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 1097 flow [2023-08-30 13:48:16,483 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 13:48:16,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:16,484 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:16,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 13:48:16,484 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 13:48:16,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:16,484 INFO L85 PathProgramCache]: Analyzing trace with hash -440535511, now seen corresponding path program 2 times [2023-08-30 13:48:16,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:16,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156381493] [2023-08-30 13:48:16,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:16,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:16,650 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 13:48:16,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:16,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156381493] [2023-08-30 13:48:16,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156381493] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:16,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:16,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 13:48:16,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067717798] [2023-08-30 13:48:16,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:16,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 13:48:16,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:16,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 13:48:16,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 13:48:16,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-08-30 13:48:16,773 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 13:48:16,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:16,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-08-30 13:48:16,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:17,049 INFO L130 PetriNetUnfolder]: 448/985 cut-off events. [2023-08-30 13:48:17,049 INFO L131 PetriNetUnfolder]: For 5847/5847 co-relation queries the response was YES. [2023-08-30 13:48:17,052 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 13:48:17,056 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 97 selfloop transitions, 44 changer transitions 0/141 dead transitions. [2023-08-30 13:48:17,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 141 transitions, 1667 flow [2023-08-30 13:48:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 13:48:17,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 13:48:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1006 transitions. [2023-08-30 13:48:17,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4572727272727273 [2023-08-30 13:48:17,058 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1006 transitions. [2023-08-30 13:48:17,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1006 transitions. [2023-08-30 13:48:17,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:17,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1006 transitions. [2023-08-30 13:48:17,060 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 13:48:17,063 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 13:48:17,064 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 13:48:17,064 INFO L175 Difference]: Start difference. First operand has 114 places, 105 transitions, 1097 flow. Second operand 11 states and 1006 transitions. [2023-08-30 13:48:17,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 141 transitions, 1667 flow [2023-08-30 13:48:17,074 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 13:48:17,078 INFO L231 Difference]: Finished difference. Result has 124 places, 119 transitions, 1375 flow [2023-08-30 13:48:17,078 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 13:48:17,079 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 92 predicate places. [2023-08-30 13:48:17,079 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 119 transitions, 1375 flow [2023-08-30 13:48:17,079 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 13:48:17,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:17,079 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:17,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 13:48:17,080 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 13:48:17,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:17,080 INFO L85 PathProgramCache]: Analyzing trace with hash -440304860, now seen corresponding path program 2 times [2023-08-30 13:48:17,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:17,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544904980] [2023-08-30 13:48:17,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:17,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:17,254 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 13:48:17,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:17,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544904980] [2023-08-30 13:48:17,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544904980] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:17,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:17,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 13:48:17,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258335873] [2023-08-30 13:48:17,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:17,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 13:48:17,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:17,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 13:48:17,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 13:48:17,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-08-30 13:48:17,398 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 13:48:17,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:17,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-08-30 13:48:17,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:17,772 INFO L130 PetriNetUnfolder]: 459/1008 cut-off events. [2023-08-30 13:48:17,773 INFO L131 PetriNetUnfolder]: For 7923/7923 co-relation queries the response was YES. [2023-08-30 13:48:17,775 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 13:48:17,782 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 107 selfloop transitions, 36 changer transitions 0/143 dead transitions. [2023-08-30 13:48:17,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 143 transitions, 1861 flow [2023-08-30 13:48:17,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 13:48:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 13:48:17,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 929 transitions. [2023-08-30 13:48:17,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645 [2023-08-30 13:48:17,786 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 929 transitions. [2023-08-30 13:48:17,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 929 transitions. [2023-08-30 13:48:17,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:17,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 929 transitions. [2023-08-30 13:48:17,790 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 13:48:17,797 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 13:48:17,798 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 13:48:17,798 INFO L175 Difference]: Start difference. First operand has 124 places, 119 transitions, 1375 flow. Second operand 10 states and 929 transitions. [2023-08-30 13:48:17,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 143 transitions, 1861 flow [2023-08-30 13:48:17,810 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 13:48:17,812 INFO L231 Difference]: Finished difference. Result has 132 places, 125 transitions, 1538 flow [2023-08-30 13:48:17,813 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 13:48:17,813 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 100 predicate places. [2023-08-30 13:48:17,813 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 125 transitions, 1538 flow [2023-08-30 13:48:17,814 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 13:48:17,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:17,814 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:17,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 13:48:17,814 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 13:48:17,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:17,814 INFO L85 PathProgramCache]: Analyzing trace with hash -440601530, now seen corresponding path program 3 times [2023-08-30 13:48:17,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:17,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91642655] [2023-08-30 13:48:17,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:17,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:17,984 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 13:48:17,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:17,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91642655] [2023-08-30 13:48:17,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91642655] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:17,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:17,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 13:48:17,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34377938] [2023-08-30 13:48:17,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:17,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 13:48:17,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:17,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 13:48:17,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-30 13:48:18,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 200 [2023-08-30 13:48:18,076 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 13:48:18,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:18,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 200 [2023-08-30 13:48:18,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:18,419 INFO L130 PetriNetUnfolder]: 481/1058 cut-off events. [2023-08-30 13:48:18,420 INFO L131 PetriNetUnfolder]: For 9365/9365 co-relation queries the response was YES. [2023-08-30 13:48:18,423 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 13:48:18,435 INFO L137 encePairwiseOnDemand]: 192/200 looper letters, 109 selfloop transitions, 55 changer transitions 0/164 dead transitions. [2023-08-30 13:48:18,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 164 transitions, 2203 flow [2023-08-30 13:48:18,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 13:48:18,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 13:48:18,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1025 transitions. [2023-08-30 13:48:18,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2023-08-30 13:48:18,438 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1025 transitions. [2023-08-30 13:48:18,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1025 transitions. [2023-08-30 13:48:18,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:18,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1025 transitions. [2023-08-30 13:48:18,440 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 13:48:18,442 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 13:48:18,442 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 13:48:18,443 INFO L175 Difference]: Start difference. First operand has 132 places, 125 transitions, 1538 flow. Second operand 11 states and 1025 transitions. [2023-08-30 13:48:18,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 164 transitions, 2203 flow [2023-08-30 13:48:18,457 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 13:48:18,461 INFO L231 Difference]: Finished difference. Result has 137 places, 132 transitions, 1702 flow [2023-08-30 13:48:18,461 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 13:48:18,461 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 105 predicate places. [2023-08-30 13:48:18,461 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 132 transitions, 1702 flow [2023-08-30 13:48:18,462 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 13:48:18,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:18,462 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:18,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 13:48:18,462 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 13:48:18,462 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:18,462 INFO L85 PathProgramCache]: Analyzing trace with hash -440601541, now seen corresponding path program 3 times [2023-08-30 13:48:18,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:18,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495243445] [2023-08-30 13:48:18,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:18,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:18,606 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 13:48:18,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:18,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495243445] [2023-08-30 13:48:18,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495243445] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:18,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:18,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 13:48:18,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231379176] [2023-08-30 13:48:18,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:18,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 13:48:18,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:18,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 13:48:18,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-30 13:48:18,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-08-30 13:48:18,729 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 13:48:18,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:18,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-08-30 13:48:18,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:19,053 INFO L130 PetriNetUnfolder]: 474/1044 cut-off events. [2023-08-30 13:48:19,053 INFO L131 PetriNetUnfolder]: For 9731/9731 co-relation queries the response was YES. [2023-08-30 13:48:19,056 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 13:48:19,060 INFO L137 encePairwiseOnDemand]: 192/200 looper letters, 108 selfloop transitions, 54 changer transitions 0/162 dead transitions. [2023-08-30 13:48:19,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 162 transitions, 2233 flow [2023-08-30 13:48:19,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 13:48:19,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 13:48:19,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1013 transitions. [2023-08-30 13:48:19,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46045454545454545 [2023-08-30 13:48:19,062 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1013 transitions. [2023-08-30 13:48:19,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1013 transitions. [2023-08-30 13:48:19,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:19,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1013 transitions. [2023-08-30 13:48:19,064 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 13:48:19,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 200.0) internal successors, (2400), 12 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:48:19,066 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 13:48:19,066 INFO L175 Difference]: Start difference. First operand has 137 places, 132 transitions, 1702 flow. Second operand 11 states and 1013 transitions. [2023-08-30 13:48:19,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 162 transitions, 2233 flow [2023-08-30 13:48:19,082 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 13:48:19,085 INFO L231 Difference]: Finished difference. Result has 140 places, 130 transitions, 1695 flow [2023-08-30 13:48:19,085 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 13:48:19,085 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 108 predicate places. [2023-08-30 13:48:19,085 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 130 transitions, 1695 flow [2023-08-30 13:48:19,086 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 13:48:19,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:19,086 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:19,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 13:48:19,086 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 13:48:19,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:19,086 INFO L85 PathProgramCache]: Analyzing trace with hash -124884211, now seen corresponding path program 1 times [2023-08-30 13:48:19,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:19,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237647424] [2023-08-30 13:48:19,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:19,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:19,255 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 13:48:19,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:19,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237647424] [2023-08-30 13:48:19,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237647424] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:48:19,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022121404] [2023-08-30 13:48:19,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:19,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:48:19,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:48:19,269 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 13:48:19,291 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 13:48:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:19,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-30 13:48:19,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:48:19,376 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 13:48:19,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:48:19,433 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 13:48:19,484 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 13:48:22,378 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 13:48:22,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:48:26,558 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_38| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_38| Int) (v_ArrVal_591 (Array Int Int)) (v_ArrVal_592 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_38| |c_#StackHeapBarrier|) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_38| v_ArrVal_591) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_38| v_ArrVal_592) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37|) 2147483650)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_37| (+ 28 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_38|)))) is different from false [2023-08-30 13:48:26,669 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 13:48:26,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022121404] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:48:26,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:48:26,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2023-08-30 13:48:26,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703917747] [2023-08-30 13:48:26,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:48:26,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 13:48:26,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:26,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 13:48:26,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=238, Unknown=6, NotChecked=34, Total=380 [2023-08-30 13:48:26,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 200 [2023-08-30 13:48:26,727 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 13:48:26,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:26,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 200 [2023-08-30 13:48:26,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:28,747 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 13:48:29,789 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 13:48:30,854 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 13:48:32,855 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 13:48:33,945 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 13:48:36,044 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 13:48:37,163 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 13:48:39,387 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 13:48:41,387 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 13:48:43,916 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 13:48:45,043 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 13:48:46,173 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 13:48:52,015 INFO L130 PetriNetUnfolder]: 488/1069 cut-off events. [2023-08-30 13:48:52,016 INFO L131 PetriNetUnfolder]: For 10882/10882 co-relation queries the response was YES. [2023-08-30 13:48:52,019 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 13:48:52,023 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 139 selfloop transitions, 90 changer transitions 0/229 dead transitions. [2023-08-30 13:48:52,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 229 transitions, 3139 flow [2023-08-30 13:48:52,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 13:48:52,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 13:48:52,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1060 transitions. [2023-08-30 13:48:52,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37857142857142856 [2023-08-30 13:48:52,025 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1060 transitions. [2023-08-30 13:48:52,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1060 transitions. [2023-08-30 13:48:52,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:52,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1060 transitions. [2023-08-30 13:48:52,026 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 13:48:52,028 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 13:48:52,029 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 13:48:52,029 INFO L175 Difference]: Start difference. First operand has 140 places, 130 transitions, 1695 flow. Second operand 14 states and 1060 transitions. [2023-08-30 13:48:52,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 229 transitions, 3139 flow [2023-08-30 13:48:52,044 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 13:48:52,046 INFO L231 Difference]: Finished difference. Result has 152 places, 164 transitions, 2437 flow [2023-08-30 13:48:52,047 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 13:48:52,047 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 120 predicate places. [2023-08-30 13:48:52,047 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 164 transitions, 2437 flow [2023-08-30 13:48:52,048 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 13:48:52,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:52,048 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:52,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 13:48:52,252 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 13:48:52,252 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 13:48:52,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:52,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1133195322, now seen corresponding path program 1 times [2023-08-30 13:48:52,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:52,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23124089] [2023-08-30 13:48:52,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:52,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:48:52,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:52,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23124089] [2023-08-30 13:48:52,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23124089] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:48:52,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525323978] [2023-08-30 13:48:52,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:52,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:48:52,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:48:52,415 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 13:48:52,416 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 13:48:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:52,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-30 13:48:52,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:48:52,503 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 13:48:52,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:48:52,550 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 13:48:52,590 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 13:48:55,602 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 13:48:55,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:48:59,756 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (v_ArrVal_662 Int) (v_ArrVal_661 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| 28)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_661) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_662) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|) 2147483647))) is different from false [2023-08-30 13:48:59,838 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 13:48:59,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525323978] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:48:59,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:48:59,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2023-08-30 13:48:59,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874713611] [2023-08-30 13:48:59,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:48:59,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-30 13:48:59,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:59,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-30 13:48:59,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=216, Unknown=6, NotChecked=32, Total=342 [2023-08-30 13:48:59,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 200 [2023-08-30 13:48:59,867 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 13:48:59,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:59,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 200 [2023-08-30 13:48:59,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:49:01,933 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 13:49:02,985 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 13:49:04,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:05,206 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 13:49:07,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:08,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:10,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:11,993 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 13:49:13,096 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 13:49:14,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:15,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:18,360 INFO L130 PetriNetUnfolder]: 504/1095 cut-off events. [2023-08-30 13:49:18,361 INFO L131 PetriNetUnfolder]: For 13486/13486 co-relation queries the response was YES. [2023-08-30 13:49:18,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7129 conditions, 1095 events. 504/1095 cut-off events. For 13486/13486 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6273 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 13:49:18,367 INFO L137 encePairwiseOnDemand]: 191/200 looper letters, 146 selfloop transitions, 110 changer transitions 0/256 dead transitions. [2023-08-30 13:49:18,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 256 transitions, 4044 flow [2023-08-30 13:49:18,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 13:49:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 13:49:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 915 transitions. [2023-08-30 13:49:18,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4159090909090909 [2023-08-30 13:49:18,382 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 915 transitions. [2023-08-30 13:49:18,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 915 transitions. [2023-08-30 13:49:18,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:49:18,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 915 transitions. [2023-08-30 13:49:18,383 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 13:49:18,385 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 13:49:18,385 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 13:49:18,385 INFO L175 Difference]: Start difference. First operand has 152 places, 164 transitions, 2437 flow. Second operand 11 states and 915 transitions. [2023-08-30 13:49:18,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 256 transitions, 4044 flow [2023-08-30 13:49:18,452 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 13:49:18,455 INFO L231 Difference]: Finished difference. Result has 163 places, 204 transitions, 3222 flow [2023-08-30 13:49:18,455 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 13:49:18,456 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2023-08-30 13:49:18,456 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 204 transitions, 3222 flow [2023-08-30 13:49:18,456 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 13:49:18,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:49:18,456 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 13:49:18,464 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 13:49:18,662 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 13:49:18,662 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 13:49:18,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:49:18,662 INFO L85 PathProgramCache]: Analyzing trace with hash 245377895, now seen corresponding path program 1 times [2023-08-30 13:49:18,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:49:18,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349380425] [2023-08-30 13:49:18,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:49:18,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:49:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:49:18,690 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 13:49:18,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:49:18,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349380425] [2023-08-30 13:49:18,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349380425] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:49:18,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:49:18,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 13:49:18,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532331909] [2023-08-30 13:49:18,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:49:18,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 13:49:18,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:49:18,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 13:49:18,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 13:49:18,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 200 [2023-08-30 13:49:18,701 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 13:49:18,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:49:18,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 200 [2023-08-30 13:49:18,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:49:18,851 INFO L130 PetriNetUnfolder]: 486/1055 cut-off events. [2023-08-30 13:49:18,851 INFO L131 PetriNetUnfolder]: For 13385/13385 co-relation queries the response was YES. [2023-08-30 13:49:18,854 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 5912 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 13:49:18,858 INFO L137 encePairwiseOnDemand]: 198/200 looper letters, 217 selfloop transitions, 1 changer transitions 0/218 dead transitions. [2023-08-30 13:49:18,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 218 transitions, 3807 flow [2023-08-30 13:49:18,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 13:49:18,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 13:49:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-08-30 13:49:18,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5383333333333333 [2023-08-30 13:49:18,861 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-08-30 13:49:18,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-08-30 13:49:18,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:49:18,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-08-30 13:49:18,861 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 13:49:18,862 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 13:49:18,862 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 13:49:18,862 INFO L175 Difference]: Start difference. First operand has 163 places, 204 transitions, 3222 flow. Second operand 3 states and 323 transitions. [2023-08-30 13:49:18,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 218 transitions, 3807 flow [2023-08-30 13:49:18,890 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 13:49:18,893 INFO L231 Difference]: Finished difference. Result has 162 places, 203 transitions, 3143 flow [2023-08-30 13:49:18,894 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 13:49:18,894 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 130 predicate places. [2023-08-30 13:49:18,894 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 203 transitions, 3143 flow [2023-08-30 13:49:18,894 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 13:49:18,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:49:18,894 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 13:49:18,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 13:49:18,895 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 13:49:18,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:49:18,895 INFO L85 PathProgramCache]: Analyzing trace with hash 245377907, now seen corresponding path program 1 times [2023-08-30 13:49:18,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:49:18,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276440315] [2023-08-30 13:49:18,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:49:18,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:49:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:49:18,920 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 13:49:18,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:49:18,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276440315] [2023-08-30 13:49:18,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276440315] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:49:18,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:49:18,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 13:49:18,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692195828] [2023-08-30 13:49:18,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:49:18,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 13:49:18,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:49:18,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 13:49:18,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 13:49:18,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 200 [2023-08-30 13:49:18,928 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 13:49:18,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:49:18,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 200 [2023-08-30 13:49:18,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:49:19,090 INFO L130 PetriNetUnfolder]: 468/1015 cut-off events. [2023-08-30 13:49:19,091 INFO L131 PetriNetUnfolder]: For 11963/11963 co-relation queries the response was YES. [2023-08-30 13:49:19,093 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 5656 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 13:49:19,097 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 216 selfloop transitions, 11 changer transitions 0/227 dead transitions. [2023-08-30 13:49:19,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 227 transitions, 3856 flow [2023-08-30 13:49:19,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 13:49:19,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 13:49:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2023-08-30 13:49:19,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.535 [2023-08-30 13:49:19,098 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2023-08-30 13:49:19,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2023-08-30 13:49:19,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:49:19,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2023-08-30 13:49:19,101 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 13:49:19,101 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 13:49:19,101 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 13:49:19,102 INFO L175 Difference]: Start difference. First operand has 162 places, 203 transitions, 3143 flow. Second operand 3 states and 321 transitions. [2023-08-30 13:49:19,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 227 transitions, 3856 flow [2023-08-30 13:49:19,125 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 13:49:19,129 INFO L231 Difference]: Finished difference. Result has 163 places, 203 transitions, 3177 flow [2023-08-30 13:49:19,129 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 13:49:19,130 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 131 predicate places. [2023-08-30 13:49:19,130 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 203 transitions, 3177 flow [2023-08-30 13:49:19,130 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 13:49:19,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:49:19,130 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 13:49:19,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-30 13:49:19,130 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 13:49:19,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:49:19,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1920998744, now seen corresponding path program 1 times [2023-08-30 13:49:19,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:49:19,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781920440] [2023-08-30 13:49:19,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:49:19,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:49:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:49:19,154 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 13:49:19,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:49:19,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781920440] [2023-08-30 13:49:19,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781920440] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:49:19,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:49:19,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 13:49:19,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539462963] [2023-08-30 13:49:19,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:49:19,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 13:49:19,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:49:19,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 13:49:19,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 13:49:19,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 200 [2023-08-30 13:49:19,162 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 13:49:19,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:49:19,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 200 [2023-08-30 13:49:19,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:49:19,304 INFO L130 PetriNetUnfolder]: 447/969 cut-off events. [2023-08-30 13:49:19,304 INFO L131 PetriNetUnfolder]: For 11805/11805 co-relation queries the response was YES. [2023-08-30 13:49:19,307 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 5366 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 13:49:19,310 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 221 selfloop transitions, 12 changer transitions 0/233 dead transitions. [2023-08-30 13:49:19,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 233 transitions, 3964 flow [2023-08-30 13:49:19,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 13:49:19,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 13:49:19,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2023-08-30 13:49:19,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5433333333333333 [2023-08-30 13:49:19,311 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 326 transitions. [2023-08-30 13:49:19,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions. [2023-08-30 13:49:19,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:49:19,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions. [2023-08-30 13:49:19,312 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 13:49:19,313 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 13:49:19,313 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 13:49:19,313 INFO L175 Difference]: Start difference. First operand has 163 places, 203 transitions, 3177 flow. Second operand 3 states and 326 transitions. [2023-08-30 13:49:19,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 233 transitions, 3964 flow [2023-08-30 13:49:19,338 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 13:49:19,340 INFO L231 Difference]: Finished difference. Result has 164 places, 203 transitions, 3208 flow [2023-08-30 13:49:19,341 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 13:49:19,341 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 132 predicate places. [2023-08-30 13:49:19,341 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 203 transitions, 3208 flow [2023-08-30 13:49:19,341 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 13:49:19,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:49:19,341 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 13:49:19,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-30 13:49:19,342 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 13:49:19,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:49:19,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1920998742, now seen corresponding path program 1 times [2023-08-30 13:49:19,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:49:19,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512777386] [2023-08-30 13:49:19,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:49:19,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:49:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:49:19,371 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 13:49:19,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:49:19,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512777386] [2023-08-30 13:49:19,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512777386] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:49:19,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:49:19,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 13:49:19,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275504409] [2023-08-30 13:49:19,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:49:19,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 13:49:19,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:49:19,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 13:49:19,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 13:49:19,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 200 [2023-08-30 13:49:19,378 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 13:49:19,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:49:19,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 200 [2023-08-30 13:49:19,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:49:19,520 INFO L130 PetriNetUnfolder]: 426/923 cut-off events. [2023-08-30 13:49:19,520 INFO L131 PetriNetUnfolder]: For 11812/11812 co-relation queries the response was YES. [2023-08-30 13:49:19,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6660 conditions, 923 events. 426/923 cut-off events. For 11812/11812 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4952 event pairs, 131 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 13:49:19,526 INFO L137 encePairwiseOnDemand]: 198/200 looper letters, 220 selfloop transitions, 1 changer transitions 0/221 dead transitions. [2023-08-30 13:49:19,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 221 transitions, 3818 flow [2023-08-30 13:49:19,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 13:49:19,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 13:49:19,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2023-08-30 13:49:19,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5433333333333333 [2023-08-30 13:49:19,527 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 326 transitions. [2023-08-30 13:49:19,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions. [2023-08-30 13:49:19,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:49:19,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions. [2023-08-30 13:49:19,528 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 13:49:19,529 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 13:49:19,529 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 13:49:19,529 INFO L175 Difference]: Start difference. First operand has 164 places, 203 transitions, 3208 flow. Second operand 3 states and 326 transitions. [2023-08-30 13:49:19,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 221 transitions, 3818 flow [2023-08-30 13:49:19,560 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 13:49:19,563 INFO L231 Difference]: Finished difference. Result has 164 places, 202 transitions, 3192 flow [2023-08-30 13:49:19,563 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 13:49:19,563 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 132 predicate places. [2023-08-30 13:49:19,563 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 202 transitions, 3192 flow [2023-08-30 13:49:19,564 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 13:49:19,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:49:19,564 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:49:19,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-30 13:49:19,564 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 13:49:19,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:49:19,564 INFO L85 PathProgramCache]: Analyzing trace with hash 706227974, now seen corresponding path program 1 times [2023-08-30 13:49:19,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:49:19,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551313091] [2023-08-30 13:49:19,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:49:19,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:49:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:49:19,854 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 13:49:19,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:49:19,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551313091] [2023-08-30 13:49:19,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551313091] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:49:19,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403363366] [2023-08-30 13:49:19,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:49:19,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:49:19,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:49:19,855 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 13:49:19,857 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 13:49:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:49:19,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 13:49:19,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:49:19,959 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 13:49:20,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:49:20,043 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 13:49:20,147 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 13:49:20,289 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 13:49:20,310 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 13:49:20,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:49:20,619 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int)) (v_ArrVal_890 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_40| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_40| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_40| v_ArrVal_887) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_890) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| (+ 28 |c_~#cache~0.offset|)))) is different from false [2023-08-30 13:49:20,705 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 13:49:20,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403363366] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:49:20,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:49:20,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-08-30 13:49:20,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652134711] [2023-08-30 13:49:20,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:49:20,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 13:49:20,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:49:20,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 13:49:20,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=725, Unknown=1, NotChecked=56, Total=930 [2023-08-30 13:49:20,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 200 [2023-08-30 13:49:20,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 202 transitions, 3192 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 13:49:20,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:49:20,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 200 [2023-08-30 13:49:20,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:49:24,637 INFO L130 PetriNetUnfolder]: 922/1930 cut-off events. [2023-08-30 13:49:24,637 INFO L131 PetriNetUnfolder]: For 29969/29969 co-relation queries the response was YES. [2023-08-30 13:49:24,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14088 conditions, 1930 events. 922/1930 cut-off events. For 29969/29969 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 12076 event pairs, 111 based on Foata normal form. 63/1993 useless extension candidates. Maximal degree in co-relation 14010. Up to 818 conditions per place. [2023-08-30 13:49:24,651 INFO L137 encePairwiseOnDemand]: 183/200 looper letters, 272 selfloop transitions, 309 changer transitions 0/581 dead transitions. [2023-08-30 13:49:24,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 581 transitions, 9914 flow [2023-08-30 13:49:24,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-30 13:49:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-30 13:49:24,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2337 transitions. [2023-08-30 13:49:24,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35409090909090907 [2023-08-30 13:49:24,655 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 2337 transitions. [2023-08-30 13:49:24,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 2337 transitions. [2023-08-30 13:49:24,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:49:24,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2337 transitions. [2023-08-30 13:49:24,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 70.81818181818181) internal successors, (2337), 33 states have internal predecessors, (2337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:49:24,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 200.0) internal successors, (6800), 34 states have internal predecessors, (6800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:49:24,665 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 200.0) internal successors, (6800), 34 states have internal predecessors, (6800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:49:24,665 INFO L175 Difference]: Start difference. First operand has 164 places, 202 transitions, 3192 flow. Second operand 33 states and 2337 transitions. [2023-08-30 13:49:24,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 581 transitions, 9914 flow [2023-08-30 13:49:24,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 581 transitions, 9911 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 13:49:24,722 INFO L231 Difference]: Finished difference. Result has 219 places, 456 transitions, 8974 flow [2023-08-30 13:49:24,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=3191, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=8974, PETRI_PLACES=219, PETRI_TRANSITIONS=456} [2023-08-30 13:49:24,723 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 187 predicate places. [2023-08-30 13:49:24,723 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 456 transitions, 8974 flow [2023-08-30 13:49:24,724 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 13:49:24,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:49:24,724 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:49:24,747 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 13:49:24,928 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 13:49:24,929 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 13:49:24,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:49:24,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2090138996, now seen corresponding path program 1 times [2023-08-30 13:49:24,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:49:24,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412002635] [2023-08-30 13:49:24,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:49:24,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:49:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:49:24,962 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 13:49:24,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:49:24,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412002635] [2023-08-30 13:49:24,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412002635] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:49:24,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119283717] [2023-08-30 13:49:24,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:49:24,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:49:24,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:49:24,977 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 13:49:25,013 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 13:49:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:49:25,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 13:49:25,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:49:25,113 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 13:49:25,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:49:25,125 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 13:49:25,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119283717] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:49:25,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:49:25,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-30 13:49:25,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135323558] [2023-08-30 13:49:25,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:49:25,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 13:49:25,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:49:25,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 13:49:25,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 13:49:25,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 200 [2023-08-30 13:49:25,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 456 transitions, 8974 flow. Second operand has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:49:25,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:49:25,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 200 [2023-08-30 13:49:25,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:49:25,838 INFO L130 PetriNetUnfolder]: 1358/2922 cut-off events. [2023-08-30 13:49:25,838 INFO L131 PetriNetUnfolder]: For 84966/84966 co-relation queries the response was YES. [2023-08-30 13:49:25,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26979 conditions, 2922 events. 1358/2922 cut-off events. For 84966/84966 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 17145 event pairs, 322 based on Foata normal form. 144/3066 useless extension candidates. Maximal degree in co-relation 26876. Up to 724 conditions per place. [2023-08-30 13:49:25,867 INFO L137 encePairwiseOnDemand]: 196/200 looper letters, 723 selfloop transitions, 54 changer transitions 0/777 dead transitions. [2023-08-30 13:49:25,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 777 transitions, 16860 flow [2023-08-30 13:49:25,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 13:49:25,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 13:49:25,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions. [2023-08-30 13:49:25,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5358333333333334 [2023-08-30 13:49:25,869 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 643 transitions. [2023-08-30 13:49:25,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 643 transitions. [2023-08-30 13:49:25,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:49:25,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 643 transitions. [2023-08-30 13:49:25,870 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 13:49:25,871 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 13:49:25,871 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 13:49:25,871 INFO L175 Difference]: Start difference. First operand has 219 places, 456 transitions, 8974 flow. Second operand 6 states and 643 transitions. [2023-08-30 13:49:25,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 777 transitions, 16860 flow [2023-08-30 13:49:26,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 777 transitions, 15531 flow, removed 638 selfloop flow, removed 3 redundant places. [2023-08-30 13:49:26,154 INFO L231 Difference]: Finished difference. Result has 225 places, 472 transitions, 8513 flow [2023-08-30 13:49:26,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=8025, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8513, PETRI_PLACES=225, PETRI_TRANSITIONS=472} [2023-08-30 13:49:26,154 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 193 predicate places. [2023-08-30 13:49:26,154 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 472 transitions, 8513 flow [2023-08-30 13:49:26,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:49:26,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:49:26,155 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:49:26,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-30 13:49:26,359 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 13:49:26,360 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 13:49:26,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:49:26,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1572468485, now seen corresponding path program 1 times [2023-08-30 13:49:26,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:49:26,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843289425] [2023-08-30 13:49:26,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:49:26,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:49:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:49:26,615 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:49:26,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:49:26,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843289425] [2023-08-30 13:49:26,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843289425] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:49:26,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660445766] [2023-08-30 13:49:26,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:49:26,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:49:26,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:49:26,617 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 13:49:26,650 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 13:49:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:49:26,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 13:49:26,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:49:26,730 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 13:49:26,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:49:26,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 13:49:26,900 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 13:49:27,038 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 13:49:27,059 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 13:49:27,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:49:27,344 WARN L839 $PredicateComparison]: unable to prove that (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|)))) is different from false [2023-08-30 13:49:27,422 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 13:49:27,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660445766] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:49:27,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:49:27,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 28 [2023-08-30 13:49:27,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539630204] [2023-08-30 13:49:27,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:49:27,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 13:49:27,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:49:27,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 13:49:27,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=697, Unknown=1, NotChecked=54, Total=870 [2023-08-30 13:49:27,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 200 [2023-08-30 13:49:27,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 472 transitions, 8513 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 13:49:27,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:49:27,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 200 [2023-08-30 13:49:27,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:49:38,516 INFO L130 PetriNetUnfolder]: 2409/5151 cut-off events. [2023-08-30 13:49:38,517 INFO L131 PetriNetUnfolder]: For 143206/143206 co-relation queries the response was YES. [2023-08-30 13:49:38,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46000 conditions, 5151 events. 2409/5151 cut-off events. For 143206/143206 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 35865 event pairs, 337 based on Foata normal form. 112/5263 useless extension candidates. Maximal degree in co-relation 45896. Up to 2469 conditions per place. [2023-08-30 13:49:38,558 INFO L137 encePairwiseOnDemand]: 184/200 looper letters, 552 selfloop transitions, 775 changer transitions 0/1327 dead transitions. [2023-08-30 13:49:38,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 1327 transitions, 25433 flow [2023-08-30 13:49:38,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2023-08-30 13:49:38,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2023-08-30 13:49:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 7274 transitions. [2023-08-30 13:49:38,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30822033898305085 [2023-08-30 13:49:38,566 INFO L72 ComplementDD]: Start complementDD. Operand 118 states and 7274 transitions. [2023-08-30 13:49:38,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 7274 transitions. [2023-08-30 13:49:38,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:49:38,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 118 states and 7274 transitions. [2023-08-30 13:49:38,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 119 states, 118 states have (on average 61.644067796610166) internal successors, (7274), 118 states have internal predecessors, (7274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:49:38,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 119 states, 119 states have (on average 200.0) internal successors, (23800), 119 states have internal predecessors, (23800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:49:38,591 INFO L81 ComplementDD]: Finished complementDD. Result has 119 states, 119 states have (on average 200.0) internal successors, (23800), 119 states have internal predecessors, (23800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:49:38,591 INFO L175 Difference]: Start difference. First operand has 225 places, 472 transitions, 8513 flow. Second operand 118 states and 7274 transitions. [2023-08-30 13:49:38,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 1327 transitions, 25433 flow [2023-08-30 13:49:38,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 1327 transitions, 25314 flow, removed 33 selfloop flow, removed 1 redundant places. [2023-08-30 13:49:38,995 INFO L231 Difference]: Finished difference. Result has 405 places, 1104 transitions, 23330 flow [2023-08-30 13:49:38,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=8448, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=256, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=118, PETRI_FLOW=23330, PETRI_PLACES=405, PETRI_TRANSITIONS=1104} [2023-08-30 13:49:38,996 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 373 predicate places. [2023-08-30 13:49:38,996 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 1104 transitions, 23330 flow [2023-08-30 13:49:38,996 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 13:49:38,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:49:38,997 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:49:39,002 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 13:49:39,201 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 13:49:39,202 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 13:49:39,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:49:39,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1988282868, now seen corresponding path program 2 times [2023-08-30 13:49:39,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:49:39,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875510875] [2023-08-30 13:49:39,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:49:39,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:49:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:49:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:49:39,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:49:39,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875510875] [2023-08-30 13:49:39,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875510875] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:49:39,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212972784] [2023-08-30 13:49:39,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 13:49:39,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:49:39,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:49:39,616 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 13:49:39,618 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 13:49:39,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 13:49:39,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 13:49:39,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 13:49:39,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:49:39,744 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 13:49:39,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:49:39,816 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 13:49:39,928 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 13:49:40,028 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 13:49:40,098 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 13:49:40,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:49:40,473 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 (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1121) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1125) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ 28 |c_~#cache~0.offset|)))) is different from false [2023-08-30 13:49:40,562 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 13:49:40,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212972784] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:49:40,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:49:40,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-08-30 13:49:40,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074748098] [2023-08-30 13:49:40,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:49:40,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 13:49:40,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:49:40,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 13:49:40,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=696, Unknown=1, NotChecked=56, Total=930 [2023-08-30 13:49:40,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 200 [2023-08-30 13:49:40,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 1104 transitions, 23330 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 13:49:40,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:49:40,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 200 [2023-08-30 13:49:40,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:49:48,300 INFO L130 PetriNetUnfolder]: 3302/7040 cut-off events. [2023-08-30 13:49:48,301 INFO L131 PetriNetUnfolder]: For 506983/506983 co-relation queries the response was YES. [2023-08-30 13:49:48,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82802 conditions, 7040 events. 3302/7040 cut-off events. For 506983/506983 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 51863 event pairs, 489 based on Foata normal form. 158/7198 useless extension candidates. Maximal degree in co-relation 82632. Up to 3904 conditions per place. [2023-08-30 13:49:48,399 INFO L137 encePairwiseOnDemand]: 185/200 looper letters, 902 selfloop transitions, 854 changer transitions 0/1756 dead transitions. [2023-08-30 13:49:48,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 1756 transitions, 40698 flow [2023-08-30 13:49:48,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-30 13:49:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-30 13:49:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2419 transitions. [2023-08-30 13:49:48,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35573529411764704 [2023-08-30 13:49:48,406 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 2419 transitions. [2023-08-30 13:49:48,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 2419 transitions. [2023-08-30 13:49:48,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:49:48,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 2419 transitions. [2023-08-30 13:49:48,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 71.1470588235294) internal successors, (2419), 34 states have internal predecessors, (2419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:49:48,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 200.0) internal successors, (7000), 35 states have internal predecessors, (7000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:49:48,413 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 200.0) internal successors, (7000), 35 states have internal predecessors, (7000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:49:48,413 INFO L175 Difference]: Start difference. First operand has 405 places, 1104 transitions, 23330 flow. Second operand 34 states and 2419 transitions. [2023-08-30 13:49:48,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 1756 transitions, 40698 flow [2023-08-30 13:49:50,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 1756 transitions, 36973 flow, removed 1848 selfloop flow, removed 2 redundant places. [2023-08-30 13:49:50,613 INFO L231 Difference]: Finished difference. Result has 459 places, 1516 transitions, 33040 flow [2023-08-30 13:49:50,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=20768, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=494, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=33040, PETRI_PLACES=459, PETRI_TRANSITIONS=1516} [2023-08-30 13:49:50,615 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 427 predicate places. [2023-08-30 13:49:50,615 INFO L495 AbstractCegarLoop]: Abstraction has has 459 places, 1516 transitions, 33040 flow [2023-08-30 13:49:50,615 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 13:49:50,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:49:50,615 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:49:50,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-08-30 13:49:50,820 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 13:49:50,820 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 13:49:50,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:49:50,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1762808460, now seen corresponding path program 3 times [2023-08-30 13:49:50,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:49:50,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528293745] [2023-08-30 13:49:50,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:49:50,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:49:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:49:51,168 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 13:49:51,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:49:51,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528293745] [2023-08-30 13:49:51,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528293745] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:49:51,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443113705] [2023-08-30 13:49:51,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 13:49:51,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:49:51,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:49:51,173 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 13:49:51,175 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 13:49:51,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 13:49:51,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 13:49:51,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 13:49:51,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:49:51,285 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 13:49:51,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:49:51,355 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 13:49:51,513 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 13:49:51,573 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 13:49:51,616 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 13:49:51,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:49:51,900 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_1201 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int) (v_ArrVal_1204 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_43| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_1201) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1204) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 2147483647))) is different from false [2023-08-30 13:49:51,982 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 13:49:51,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443113705] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:49:51,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:49:51,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-08-30 13:49:51,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422395387] [2023-08-30 13:49:51,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:49:51,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 13:49:51,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:49:51,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 13:49:51,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=691, Unknown=1, NotChecked=56, Total=930 [2023-08-30 13:49:52,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 200 [2023-08-30 13:49:52,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 1516 transitions, 33040 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 13:49:52,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:49:52,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 200 [2023-08-30 13:49:52,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:50:01,136 INFO L130 PetriNetUnfolder]: 3621/7748 cut-off events. [2023-08-30 13:50:01,137 INFO L131 PetriNetUnfolder]: For 652869/652869 co-relation queries the response was YES. [2023-08-30 13:50:01,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97769 conditions, 7748 events. 3621/7748 cut-off events. For 652869/652869 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 59152 event pairs, 662 based on Foata normal form. 89/7837 useless extension candidates. Maximal degree in co-relation 97576. Up to 5152 conditions per place. [2023-08-30 13:50:01,232 INFO L137 encePairwiseOnDemand]: 184/200 looper letters, 1042 selfloop transitions, 988 changer transitions 0/2030 dead transitions. [2023-08-30 13:50:01,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 2030 transitions, 48550 flow [2023-08-30 13:50:01,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-08-30 13:50:01,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2023-08-30 13:50:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 4208 transitions. [2023-08-30 13:50:01,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3393548387096774 [2023-08-30 13:50:01,237 INFO L72 ComplementDD]: Start complementDD. Operand 62 states and 4208 transitions. [2023-08-30 13:50:01,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 4208 transitions. [2023-08-30 13:50:01,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:50:01,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 62 states and 4208 transitions. [2023-08-30 13:50:01,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 63 states, 62 states have (on average 67.87096774193549) internal successors, (4208), 62 states have internal predecessors, (4208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:50:01,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 63 states, 63 states have (on average 200.0) internal successors, (12600), 63 states have internal predecessors, (12600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:50:01,247 INFO L81 ComplementDD]: Finished complementDD. Result has 63 states, 63 states have (on average 200.0) internal successors, (12600), 63 states have internal predecessors, (12600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:50:01,248 INFO L175 Difference]: Start difference. First operand has 459 places, 1516 transitions, 33040 flow. Second operand 62 states and 4208 transitions. [2023-08-30 13:50:01,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 2030 transitions, 48550 flow [2023-08-30 13:50:04,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 2030 transitions, 46793 flow, removed 822 selfloop flow, removed 7 redundant places. [2023-08-30 13:50:04,131 INFO L231 Difference]: Finished difference. Result has 556 places, 1858 transitions, 42900 flow [2023-08-30 13:50:04,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=31430, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=672, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=42900, PETRI_PLACES=556, PETRI_TRANSITIONS=1858} [2023-08-30 13:50:04,133 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 524 predicate places. [2023-08-30 13:50:04,134 INFO L495 AbstractCegarLoop]: Abstraction has has 556 places, 1858 transitions, 42900 flow [2023-08-30 13:50:04,134 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 13:50:04,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:50:04,134 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:50:04,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-08-30 13:50:04,339 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 13:50:04,339 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 13:50:04,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:50:04,340 INFO L85 PathProgramCache]: Analyzing trace with hash 2048464348, now seen corresponding path program 4 times [2023-08-30 13:50:04,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:50:04,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538325517] [2023-08-30 13:50:04,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:50:04,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:50:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:50:04,639 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 13:50:04,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:50:04,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538325517] [2023-08-30 13:50:04,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538325517] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:50:04,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625116061] [2023-08-30 13:50:04,640 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 13:50:04,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:50:04,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:50:04,641 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 13:50:04,643 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 13:50:04,748 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 13:50:04,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 13:50:04,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 13:50:04,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:50:04,847 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 13:50:04,879 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 13:50:04,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 13:50:04,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625116061] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:50:04,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 13:50:04,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 15 [2023-08-30 13:50:04,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192736524] [2023-08-30 13:50:04,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:50:04,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 13:50:04,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:50:04,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 13:50:04,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-08-30 13:50:04,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-08-30 13:50:04,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 1858 transitions, 42900 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 13:50:04,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:50:04,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-08-30 13:50:04,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:50:08,403 INFO L130 PetriNetUnfolder]: 2780/5968 cut-off events. [2023-08-30 13:50:08,403 INFO L131 PetriNetUnfolder]: For 663450/663450 co-relation queries the response was YES. [2023-08-30 13:50:08,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80802 conditions, 5968 events. 2780/5968 cut-off events. For 663450/663450 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 42457 event pairs, 738 based on Foata normal form. 6/5974 useless extension candidates. Maximal degree in co-relation 80585. Up to 4872 conditions per place. [2023-08-30 13:50:08,489 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 1237 selfloop transitions, 43 changer transitions 0/1280 dead transitions. [2023-08-30 13:50:08,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 1280 transitions, 31667 flow [2023-08-30 13:50:08,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 13:50:08,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 13:50:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 579 transitions. [2023-08-30 13:50:08,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4825 [2023-08-30 13:50:08,497 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 579 transitions. [2023-08-30 13:50:08,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 579 transitions. [2023-08-30 13:50:08,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:50:08,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 579 transitions. [2023-08-30 13:50:08,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.5) internal successors, (579), 6 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:50:08,513 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 13:50:08,513 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 13:50:08,513 INFO L175 Difference]: Start difference. First operand has 556 places, 1858 transitions, 42900 flow. Second operand 6 states and 579 transitions. [2023-08-30 13:50:08,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 497 places, 1280 transitions, 31667 flow [2023-08-30 13:50:11,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 1280 transitions, 30384 flow, removed 556 selfloop flow, removed 60 redundant places. [2023-08-30 13:50:11,499 INFO L231 Difference]: Finished difference. Result has 440 places, 1235 transitions, 27122 flow [2023-08-30 13:50:11,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=26873, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=27122, PETRI_PLACES=440, PETRI_TRANSITIONS=1235} [2023-08-30 13:50:11,501 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 408 predicate places. [2023-08-30 13:50:11,501 INFO L495 AbstractCegarLoop]: Abstraction has has 440 places, 1235 transitions, 27122 flow [2023-08-30 13:50:11,501 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 13:50:11,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:50:11,502 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:50:11,511 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 13:50:11,709 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 13:50:11,709 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 13:50:11,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:50:11,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2094662592, now seen corresponding path program 1 times [2023-08-30 13:50:11,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:50:11,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754319900] [2023-08-30 13:50:11,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:50:11,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:50:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:50:12,073 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 13:50:12,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:50:12,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754319900] [2023-08-30 13:50:12,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754319900] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:50:12,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887701826] [2023-08-30 13:50:12,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:50:12,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:50:12,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:50:12,075 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 13:50:12,077 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 13:50:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:50:12,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-30 13:50:12,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:50:12,373 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 13:50:12,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:50:12,460 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 13:50:12,496 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 13:50:12,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:50:17,418 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 13:50:17,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2023-08-30 13:50:17,424 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 13:50:17,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2023-08-30 13:50:17,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-30 13:50:17,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 13:50:17,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2023-08-30 13:50:17,543 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 13:50:17,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887701826] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:50:17,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:50:17,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-08-30 13:50:17,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038755787] [2023-08-30 13:50:17,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:50:17,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 13:50:17,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:50:17,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 13:50:17,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=789, Unknown=1, NotChecked=0, Total=930 [2023-08-30 13:50:19,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:50:20,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:50:22,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:50:24,949 WARN L539 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 13:50:26,969 WARN L539 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 13:50:29,428 WARN L539 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 13:50:30,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:50:32,703 WARN L539 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 13:50:35,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:50:38,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:50:40,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:50:43,761 WARN L539 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 13:50:45,790 WARN L539 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 13:50:47,805 WARN L539 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 13:50:49,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:50:52,227 WARN L539 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 13:50:54,246 WARN L539 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 13:50:56,259 WARN L539 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 13:50:58,287 WARN L539 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 13:51:00,300 WARN L539 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 13:51:02,315 WARN L539 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 13:51:04,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:51:06,610 WARN L539 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 13:51:08,622 WARN L539 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 13:51:10,635 WARN L539 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 13:51:10,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 200 [2023-08-30 13:51:10,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 1235 transitions, 27122 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 13:51:10,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:51:10,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 200 [2023-08-30 13:51:10,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:51:18,648 INFO L130 PetriNetUnfolder]: 2879/6168 cut-off events. [2023-08-30 13:51:18,648 INFO L131 PetriNetUnfolder]: For 448443/448443 co-relation queries the response was YES. [2023-08-30 13:51:18,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76204 conditions, 6168 events. 2879/6168 cut-off events. For 448443/448443 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 44420 event pairs, 485 based on Foata normal form. 74/6242 useless extension candidates. Maximal degree in co-relation 76025. Up to 3967 conditions per place. [2023-08-30 13:51:18,731 INFO L137 encePairwiseOnDemand]: 185/200 looper letters, 1014 selfloop transitions, 715 changer transitions 0/1729 dead transitions. [2023-08-30 13:51:18,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 1729 transitions, 40964 flow [2023-08-30 13:51:18,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-08-30 13:51:18,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2023-08-30 13:51:18,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 4808 transitions. [2023-08-30 13:51:18,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3082051282051282 [2023-08-30 13:51:18,736 INFO L72 ComplementDD]: Start complementDD. Operand 78 states and 4808 transitions. [2023-08-30 13:51:18,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 4808 transitions. [2023-08-30 13:51:18,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:51:18,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 4808 transitions. [2023-08-30 13:51:18,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 79 states, 78 states have (on average 61.64102564102564) internal successors, (4808), 78 states have internal predecessors, (4808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:51:18,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 79 states, 79 states have (on average 200.0) internal successors, (15800), 79 states have internal predecessors, (15800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:51:18,750 INFO L81 ComplementDD]: Finished complementDD. Result has 79 states, 79 states have (on average 200.0) internal successors, (15800), 79 states have internal predecessors, (15800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:51:18,750 INFO L175 Difference]: Start difference. First operand has 440 places, 1235 transitions, 27122 flow. Second operand 78 states and 4808 transitions. [2023-08-30 13:51:18,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 1729 transitions, 40964 flow [2023-08-30 13:51:20,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 1729 transitions, 40778 flow, removed 41 selfloop flow, removed 3 redundant places. [2023-08-30 13:51:20,951 INFO L231 Difference]: Finished difference. Result has 535 places, 1441 transitions, 34658 flow [2023-08-30 13:51:20,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=26562, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=520, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=677, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=34658, PETRI_PLACES=535, PETRI_TRANSITIONS=1441} [2023-08-30 13:51:20,960 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 503 predicate places. [2023-08-30 13:51:20,960 INFO L495 AbstractCegarLoop]: Abstraction has has 535 places, 1441 transitions, 34658 flow [2023-08-30 13:51:20,960 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 13:51:20,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:51:20,960 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:51:20,965 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 13:51:21,164 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 13:51:21,165 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 13:51:21,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:51:21,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1734745408, now seen corresponding path program 1 times [2023-08-30 13:51:21,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:51:21,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462904991] [2023-08-30 13:51:21,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:51:21,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:51:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:51:21,434 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:51:21,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:51:21,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462904991] [2023-08-30 13:51:21,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462904991] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:51:21,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323108450] [2023-08-30 13:51:21,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:51:21,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:51:21,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:51:21,435 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 13:51:21,436 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 13:51:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:51:21,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 13:51:21,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:51:21,558 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 13:51:21,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:51:21,657 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 13:51:21,795 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 13:51:21,887 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 13:51:21,906 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 13:51:21,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:51:24,382 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 13:51:24,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323108450] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:51:24,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:51:24,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-08-30 13:51:24,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617831832] [2023-08-30 13:51:24,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:51:24,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-30 13:51:24,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:51:24,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-30 13:51:24,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=823, Unknown=3, NotChecked=0, Total=992 [2023-08-30 13:51:26,402 WARN L539 Checker$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 13:51:26,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 200 [2023-08-30 13:51:26,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 1441 transitions, 34658 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 13:51:26,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:51:26,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 200 [2023-08-30 13:51:26,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:51:32,770 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1437 Int) (v_ArrVal_1439 Int)) (or (< (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_1437)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1439) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)))) (= |c_ULTIMATE.start_main_~i~2#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)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1435 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1439 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| (+ 28 |c_~#cache~0.offset|)) (< (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_1439) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|)) is different from false [2023-08-30 13:51:32,795 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (exists ((v_ArrVal_1437 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1437) (select |c_#memory_int| 1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1437 Int) (v_ArrVal_1439 Int)) (or (< (select (store (select (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_1437)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1439) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| .cse1))) (< (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483647) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1437 Int) (v_ArrVal_1439 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| .cse1) (< (select (select (let ((.cse2 (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_1437)))) (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_1439))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1435 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1439 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| (+ 28 |c_~#cache~0.offset|)) (< (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_1439) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) is different from false [2023-08-30 13:51:35,482 WARN L539 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 13:51:38,344 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~2#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)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_1435 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1439 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47| (+ 28 |c_~#cache~0.offset|)) (< (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_1439) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_47|) 2147483647))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| |c_~#cache~0.offset|)) is different from false [2023-08-30 13:51:54,875 WARN L539 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 13:52:02,009 INFO L130 PetriNetUnfolder]: 3609/7751 cut-off events. [2023-08-30 13:52:02,009 INFO L131 PetriNetUnfolder]: For 680361/680361 co-relation queries the response was YES. [2023-08-30 13:52:02,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105122 conditions, 7751 events. 3609/7751 cut-off events. For 680361/680361 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 59205 event pairs, 463 based on Foata normal form. 131/7882 useless extension candidates. Maximal degree in co-relation 104920. Up to 4908 conditions per place. [2023-08-30 13:52:02,119 INFO L137 encePairwiseOnDemand]: 182/200 looper letters, 1279 selfloop transitions, 934 changer transitions 0/2213 dead transitions. [2023-08-30 13:52:02,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 2213 transitions, 59091 flow [2023-08-30 13:52:02,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2023-08-30 13:52:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2023-08-30 13:52:02,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 5390 transitions. [2023-08-30 13:52:02,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3411392405063291 [2023-08-30 13:52:02,128 INFO L72 ComplementDD]: Start complementDD. Operand 79 states and 5390 transitions. [2023-08-30 13:52:02,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 5390 transitions. [2023-08-30 13:52:02,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:52:02,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 79 states and 5390 transitions. [2023-08-30 13:52:02,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 80 states, 79 states have (on average 68.22784810126582) internal successors, (5390), 79 states have internal predecessors, (5390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:52:02,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 80 states, 80 states have (on average 200.0) internal successors, (16000), 80 states have internal predecessors, (16000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:52:02,143 INFO L81 ComplementDD]: Finished complementDD. Result has 80 states, 80 states have (on average 200.0) internal successors, (16000), 80 states have internal predecessors, (16000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:52:02,143 INFO L175 Difference]: Start difference. First operand has 535 places, 1441 transitions, 34658 flow. Second operand 79 states and 5390 transitions. [2023-08-30 13:52:02,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 2213 transitions, 59091 flow [2023-08-30 13:52:06,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 2213 transitions, 54635 flow, removed 1734 selfloop flow, removed 24 redundant places. [2023-08-30 13:52:06,209 INFO L231 Difference]: Finished difference. Result has 640 places, 1920 transitions, 48086 flow [2023-08-30 13:52:06,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=31896, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=521, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=852, PETRI_DIFFERENCE_SUBTRAHEND_STATES=79, PETRI_FLOW=48086, PETRI_PLACES=640, PETRI_TRANSITIONS=1920} [2023-08-30 13:52:06,211 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 608 predicate places. [2023-08-30 13:52:06,211 INFO L495 AbstractCegarLoop]: Abstraction has has 640 places, 1920 transitions, 48086 flow [2023-08-30 13:52:06,212 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 13:52:06,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:52:06,212 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:52:06,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-08-30 13:52:06,416 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 13:52:06,419 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 13:52:06,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:52:06,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1883576180, now seen corresponding path program 5 times [2023-08-30 13:52:06,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:52:06,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513324262] [2023-08-30 13:52:06,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:52:06,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:52:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:52:06,798 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 13:52:06,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:52:06,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513324262] [2023-08-30 13:52:06,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513324262] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:52:06,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919897960] [2023-08-30 13:52:06,799 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 13:52:06,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:52:06,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:52:06,800 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 13:52:06,802 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 13:52:06,982 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-30 13:52:06,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 13:52:06,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 13:52:06,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:52:06,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 13:52:07,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:52:07,060 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 13:52:07,206 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 13:52:07,237 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 13:52:07,309 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 13:52:07,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:52:11,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 13:52:11,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919897960] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:52:11,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:52:11,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2023-08-30 13:52:11,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744368502] [2023-08-30 13:52:11,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:52:11,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-30 13:52:11,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:52:11,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-30 13:52:11,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=851, Unknown=2, NotChecked=0, Total=1056 [2023-08-30 13:52:12,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 200 [2023-08-30 13:52:12,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 640 places, 1920 transitions, 48086 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 13:52:12,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:52:12,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 200 [2023-08-30 13:52:12,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:52:13,461 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (exists ((v_ArrVal_1518 Int)) (= (select |c_#memory_int| 1) (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1518))) (forall ((v_ArrVal_1518 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int)) (or (< (select (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_1518)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1518 Int) (v_ArrVal_1515 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| 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_1518) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| (+ 28 |c_~#cache~0.offset|)))) (<= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) is different from false [2023-08-30 13:52:14,340 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse1 (+ .cse4 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse5 (+ 28 |c_~#cache~0.offset|)) (.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (exists ((v_ArrVal_1518 Int)) (= (select |c_#memory_int| 1) (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1518))) (forall ((v_ArrVal_1518 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int)) (or (< (select (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_1518)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse1))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((v_ArrVal_1518 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_1516 Int)) (or (< (select (store (store .cse2 .cse3 v_ArrVal_1516) (+ .cse4 |c_~#cache~0.offset|) v_ArrVal_1518) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse1))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1518 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_1516 Int)) (or (< (select (store (store .cse2 .cse3 v_ArrVal_1516) |c_~#cache~0.offset| v_ArrVal_1518) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse5))) (forall ((v_ArrVal_1518 Int) (v_ArrVal_1515 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| 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_1518) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse5))) (<= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)))) is different from false [2023-08-30 13:52:15,282 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse3 (+ .cse2 28 |c_~#cache~0.offset|)) (.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse5 (+ 28 |c_~#cache~0.offset|))) (and (exists ((v_ArrVal_1518 Int)) (= (select |c_#memory_int| 1) (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1518))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((v_ArrVal_1518 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_1516 Int)) (or (< (select (store (store .cse0 .cse1 v_ArrVal_1516) (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_1518) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse3))) (forall ((v_ArrVal_1518 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_1516 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_1516)))) (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_1518))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse3))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1518 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_1516 Int)) (or (< (select (store (store .cse0 .cse1 v_ArrVal_1516) |c_~#cache~0.offset| v_ArrVal_1518) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse5))) (forall ((v_ArrVal_1518 Int) (v_ArrVal_1515 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| 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_1518) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse5))) (<= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)))) is different from false [2023-08-30 13:52:20,437 WARN L839 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1518 Int)) (= (select |c_#memory_int| 1) (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1518))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((v_ArrVal_1518 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_1516 Int)) (or (< (select (select (let ((.cse0 (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_1516)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1518))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1518 Int) (v_ArrVal_1515 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| 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_1518) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| (+ 28 |c_~#cache~0.offset|)))) (<= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) is different from false [2023-08-30 13:52:27,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:52:27,677 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse3 (+ .cse2 28 |c_~#cache~0.offset|)) (.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse5 (+ 28 |c_~#cache~0.offset|))) (and (exists ((v_ArrVal_1518 Int)) (= (select |c_#memory_int| 1) (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1518))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((v_ArrVal_1518 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_1516 Int)) (or (< (select (store (store .cse0 .cse1 v_ArrVal_1516) (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_1518) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse3))) (forall ((v_ArrVal_1518 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_1516 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_1516)))) (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_1518))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse3))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_1518 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| Int) (v_ArrVal_1516 Int)) (or (< (select (store (store .cse0 .cse1 v_ArrVal_1516) |c_~#cache~0.offset| v_ArrVal_1518) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse5))) (forall ((v_ArrVal_1518 Int) (v_ArrVal_1515 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| 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_1518) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| .cse5))) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) is different from false [2023-08-30 13:52:34,655 WARN L839 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1518 Int)) (= (select |c_#memory_int| 1) (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1518))) (forall ((v_ArrVal_1518 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| 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_1518)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_1518 Int) (v_ArrVal_1515 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| 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_1518) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_68| (+ 28 |c_~#cache~0.offset|)))) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) is different from false [2023-08-30 13:52:43,868 INFO L130 PetriNetUnfolder]: 4727/10192 cut-off events. [2023-08-30 13:52:43,869 INFO L131 PetriNetUnfolder]: For 1016071/1016071 co-relation queries the response was YES. [2023-08-30 13:52:43,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146369 conditions, 10192 events. 4727/10192 cut-off events. For 1016071/1016071 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 84303 event pairs, 517 based on Foata normal form. 225/10417 useless extension candidates. Maximal degree in co-relation 146119. Up to 5062 conditions per place. [2023-08-30 13:52:44,058 INFO L137 encePairwiseOnDemand]: 183/200 looper letters, 1391 selfloop transitions, 2108 changer transitions 0/3499 dead transitions. [2023-08-30 13:52:44,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 732 places, 3499 transitions, 99960 flow [2023-08-30 13:52:44,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2023-08-30 13:52:44,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2023-08-30 13:52:44,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 5900 transitions. [2023-08-30 13:52:44,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3105263157894737 [2023-08-30 13:52:44,066 INFO L72 ComplementDD]: Start complementDD. Operand 95 states and 5900 transitions. [2023-08-30 13:52:44,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 5900 transitions. [2023-08-30 13:52:44,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:52:44,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 95 states and 5900 transitions. [2023-08-30 13:52:44,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 96 states, 95 states have (on average 62.10526315789474) internal successors, (5900), 95 states have internal predecessors, (5900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:52:44,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 96 states, 96 states have (on average 200.0) internal successors, (19200), 96 states have internal predecessors, (19200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:52:44,108 INFO L81 ComplementDD]: Finished complementDD. Result has 96 states, 96 states have (on average 200.0) internal successors, (19200), 96 states have internal predecessors, (19200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:52:44,109 INFO L175 Difference]: Start difference. First operand has 640 places, 1920 transitions, 48086 flow. Second operand 95 states and 5900 transitions. [2023-08-30 13:52:44,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 732 places, 3499 transitions, 99960 flow [2023-08-30 13:52:52,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 726 places, 3499 transitions, 93796 flow, removed 3049 selfloop flow, removed 6 redundant places. [2023-08-30 13:52:52,546 INFO L231 Difference]: Finished difference. Result has 782 places, 3038 transitions, 84805 flow [2023-08-30 13:52:52,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=44302, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1899, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=95, PETRI_FLOW=84805, PETRI_PLACES=782, PETRI_TRANSITIONS=3038} [2023-08-30 13:52:52,548 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 750 predicate places. [2023-08-30 13:52:52,548 INFO L495 AbstractCegarLoop]: Abstraction has has 782 places, 3038 transitions, 84805 flow [2023-08-30 13:52:52,548 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 13:52:52,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:52:52,548 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:52:52,554 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 13:52:52,754 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 13:52:52,754 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 13:52:52,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:52:52,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1868454276, now seen corresponding path program 2 times [2023-08-30 13:52:52,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:52:52,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353999936] [2023-08-30 13:52:52,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:52:52,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:52:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:52:53,079 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 13:52:53,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:52:53,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353999936] [2023-08-30 13:52:53,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353999936] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:52:53,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614996778] [2023-08-30 13:52:53,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 13:52:53,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:52:53,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:52:53,097 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 13:52:53,097 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 13:52:53,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 13:52:53,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 13:52:53,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 13:52:53,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:52:53,258 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 13:52:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 13:52:53,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 13:52:53,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614996778] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:52:53,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 13:52:53,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 14 [2023-08-30 13:52:53,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511857587] [2023-08-30 13:52:53,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:52:53,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 13:52:53,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:52:53,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 13:52:53,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-08-30 13:52:53,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-08-30 13:52:53,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 782 places, 3038 transitions, 84805 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 13:52:53,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:52:53,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-08-30 13:52:53,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:53:03,795 INFO L130 PetriNetUnfolder]: 4698/10169 cut-off events. [2023-08-30 13:53:03,795 INFO L131 PetriNetUnfolder]: For 1016243/1016243 co-relation queries the response was YES. [2023-08-30 13:53:03,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158509 conditions, 10169 events. 4698/10169 cut-off events. For 1016243/1016243 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 84340 event pairs, 877 based on Foata normal form. 3/10172 useless extension candidates. Maximal degree in co-relation 158204. Up to 8746 conditions per place. [2023-08-30 13:53:04,015 INFO L137 encePairwiseOnDemand]: 193/200 looper letters, 2990 selfloop transitions, 154 changer transitions 0/3144 dead transitions. [2023-08-30 13:53:04,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 784 places, 3144 transitions, 94548 flow [2023-08-30 13:53:04,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 13:53:04,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 13:53:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 578 transitions. [2023-08-30 13:53:04,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4816666666666667 [2023-08-30 13:53:04,017 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 578 transitions. [2023-08-30 13:53:04,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 578 transitions. [2023-08-30 13:53:04,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:53:04,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 578 transitions. [2023-08-30 13:53:04,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.33333333333333) internal successors, (578), 6 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:53:04,018 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 13:53:04,018 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 13:53:04,019 INFO L175 Difference]: Start difference. First operand has 782 places, 3038 transitions, 84805 flow. Second operand 6 states and 578 transitions. [2023-08-30 13:53:04,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 784 places, 3144 transitions, 94548 flow [2023-08-30 13:53:16,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 759 places, 3144 transitions, 86447 flow, removed 3801 selfloop flow, removed 25 redundant places. [2023-08-30 13:53:16,548 INFO L231 Difference]: Finished difference. Result has 760 places, 2960 transitions, 75019 flow [2023-08-30 13:53:16,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=74284, PETRI_DIFFERENCE_MINUEND_PLACES=754, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2793, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=75019, PETRI_PLACES=760, PETRI_TRANSITIONS=2960} [2023-08-30 13:53:16,550 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 728 predicate places. [2023-08-30 13:53:16,550 INFO L495 AbstractCegarLoop]: Abstraction has has 760 places, 2960 transitions, 75019 flow [2023-08-30 13:53:16,550 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 13:53:16,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:53:16,550 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:53:16,556 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 13:53:16,751 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 13:53:16,751 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 13:53:16,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:53:16,752 INFO L85 PathProgramCache]: Analyzing trace with hash -754327637, now seen corresponding path program 1 times [2023-08-30 13:53:16,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:53:16,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681164915] [2023-08-30 13:53:16,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:53:16,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:53:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:53:17,066 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 13:53:17,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:53:17,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681164915] [2023-08-30 13:53:17,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681164915] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:53:17,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854846229] [2023-08-30 13:53:17,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:53:17,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:53:17,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:53:17,068 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 13:53:17,108 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 13:53:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:53:17,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-30 13:53:17,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:53:17,299 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 13:53:17,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:53:17,442 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 13:53:17,464 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 13:53:17,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:53:19,414 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 13:53:19,414 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 13:53:19,421 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 13:53:19,421 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 13:53:19,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-30 13:53:19,437 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 13:53:19,437 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 33 treesize of output 37 [2023-08-30 13:53:19,519 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 13:53:19,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854846229] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:53:19,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:53:19,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-08-30 13:53:19,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833031605] [2023-08-30 13:53:19,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:53:19,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 13:53:19,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:53:19,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 13:53:19,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2023-08-30 13:53:22,867 WARN L539 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 13:53:25,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:53:25,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 200 [2023-08-30 13:53:25,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 760 places, 2960 transitions, 75019 flow. Second operand has 31 states, 31 states have (on average 75.45161290322581) internal successors, (2339), 31 states have internal predecessors, (2339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:53:25,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:53:25,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 200 [2023-08-30 13:53:25,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:53:40,607 INFO L130 PetriNetUnfolder]: 5536/11961 cut-off events. [2023-08-30 13:53:40,608 INFO L131 PetriNetUnfolder]: For 1081467/1081467 co-relation queries the response was YES. [2023-08-30 13:53:40,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177525 conditions, 11961 events. 5536/11961 cut-off events. For 1081467/1081467 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 102884 event pairs, 629 based on Foata normal form. 54/12015 useless extension candidates. Maximal degree in co-relation 177230. Up to 4563 conditions per place. [2023-08-30 13:53:40,841 INFO L137 encePairwiseOnDemand]: 186/200 looper letters, 1655 selfloop transitions, 2248 changer transitions 0/3903 dead transitions. [2023-08-30 13:53:40,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 821 places, 3903 transitions, 106579 flow [2023-08-30 13:53:40,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-08-30 13:53:40,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2023-08-30 13:53:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 4888 transitions. [2023-08-30 13:53:40,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39419354838709675 [2023-08-30 13:53:40,845 INFO L72 ComplementDD]: Start complementDD. Operand 62 states and 4888 transitions. [2023-08-30 13:53:40,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 4888 transitions. [2023-08-30 13:53:40,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:53:40,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 62 states and 4888 transitions. [2023-08-30 13:53:40,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 63 states, 62 states have (on average 78.83870967741936) internal successors, (4888), 62 states have internal predecessors, (4888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:53:40,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 63 states, 63 states have (on average 200.0) internal successors, (12600), 63 states have internal predecessors, (12600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:53:40,856 INFO L81 ComplementDD]: Finished complementDD. Result has 63 states, 63 states have (on average 200.0) internal successors, (12600), 63 states have internal predecessors, (12600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:53:40,856 INFO L175 Difference]: Start difference. First operand has 760 places, 2960 transitions, 75019 flow. Second operand 62 states and 4888 transitions. [2023-08-30 13:53:40,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 821 places, 3903 transitions, 106579 flow [2023-08-30 13:53:54,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 815 places, 3903 transitions, 105763 flow, removed 25 selfloop flow, removed 6 redundant places. [2023-08-30 13:53:54,640 INFO L231 Difference]: Finished difference. Result has 839 places, 3433 transitions, 95746 flow [2023-08-30 13:53:54,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=74348, PETRI_DIFFERENCE_MINUEND_PLACES=754, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2959, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1795, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1092, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=95746, PETRI_PLACES=839, PETRI_TRANSITIONS=3433} [2023-08-30 13:53:54,642 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 807 predicate places. [2023-08-30 13:53:54,642 INFO L495 AbstractCegarLoop]: Abstraction has has 839 places, 3433 transitions, 95746 flow [2023-08-30 13:53:54,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 75.45161290322581) internal successors, (2339), 31 states have internal predecessors, (2339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:53:54,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:53:54,643 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:53:54,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-08-30 13:53:54,848 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 13:53:54,848 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 13:53:54,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:53:54,848 INFO L85 PathProgramCache]: Analyzing trace with hash -916171766, now seen corresponding path program 1 times [2023-08-30 13:53:54,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:53:54,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826362606] [2023-08-30 13:53:54,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:53:54,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:53:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:53:55,191 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 13:53:55,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:53:55,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826362606] [2023-08-30 13:53:55,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826362606] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:53:55,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55331446] [2023-08-30 13:53:55,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:53:55,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:53:55,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:53:55,192 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 13:53:55,193 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 13:53:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:53:55,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-30 13:53:55,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:53:55,321 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 13:53:55,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:53:55,389 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 13:53:55,524 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 13:53:55,664 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 13:53:55,694 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 13:53:55,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:54:08,363 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int) (v_ArrVal_1750 Int) (v_ArrVal_1753 Int) (v_ArrVal_1749 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_1749) |c_~#cache~0.base|))) (or (< (+ (select .cse0 |c_~#cache~0.offset|) 1) v_ArrVal_1750) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_46| |c_#StackHeapBarrier|) (< (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_1750) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| v_ArrVal_1753) |c_~#cache~0.offset|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_73| (+ 28 |c_~#cache~0.offset|))))) is different from false [2023-08-30 13:54:08,472 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 13:54:08,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55331446] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:54:08,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:54:08,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2023-08-30 13:54:08,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061602848] [2023-08-30 13:54:08,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:54:08,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-30 13:54:08,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:54:08,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-30 13:54:08,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=887, Unknown=7, NotChecked=62, Total=1122 [2023-08-30 13:54:08,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 200 [2023-08-30 13:54:08,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 839 places, 3433 transitions, 95746 flow. Second operand has 34 states, 34 states have (on average 58.3235294117647) internal successors, (1983), 34 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:54:08,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:54:08,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 200 [2023-08-30 13:54:08,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:54:17,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:54:40,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 [1] [2023-08-30 13:54:43,037 WARN L539 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 13:54:46,845 WARN L539 Checker$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 13:54:48,931 WARN L539 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 13:54:51,349 WARN L539 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 13:54:53,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:55:02,488 WARN L222 SmtUtils]: Spent 6.30s on a formula simplification. DAG size of input: 90 DAG size of output: 72 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 13:55:19,380 INFO L130 PetriNetUnfolder]: 5926/12798 cut-off events. [2023-08-30 13:55:19,380 INFO L131 PetriNetUnfolder]: For 1328176/1328176 co-relation queries the response was YES. [2023-08-30 13:55:19,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202466 conditions, 12798 events. 5926/12798 cut-off events. For 1328176/1328176 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 111093 event pairs, 714 based on Foata normal form. 123/12921 useless extension candidates. Maximal degree in co-relation 202148. Up to 8822 conditions per place. [2023-08-30 13:55:19,631 INFO L137 encePairwiseOnDemand]: 186/200 looper letters, 2460 selfloop transitions, 1624 changer transitions 0/4084 dead transitions. [2023-08-30 13:55:19,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 915 places, 4084 transitions, 123055 flow [2023-08-30 13:55:19,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-08-30 13:55:19,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2023-08-30 13:55:19,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 4726 transitions. [2023-08-30 13:55:19,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30688311688311687 [2023-08-30 13:55:19,635 INFO L72 ComplementDD]: Start complementDD. Operand 77 states and 4726 transitions. [2023-08-30 13:55:19,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 4726 transitions. [2023-08-30 13:55:19,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:55:19,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 77 states and 4726 transitions. [2023-08-30 13:55:19,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 78 states, 77 states have (on average 61.37662337662338) internal successors, (4726), 77 states have internal predecessors, (4726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:55:19,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 78 states, 78 states have (on average 200.0) internal successors, (15600), 78 states have internal predecessors, (15600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:55:19,646 INFO L81 ComplementDD]: Finished complementDD. Result has 78 states, 78 states have (on average 200.0) internal successors, (15600), 78 states have internal predecessors, (15600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:55:19,646 INFO L175 Difference]: Start difference. First operand has 839 places, 3433 transitions, 95746 flow. Second operand 77 states and 4726 transitions. [2023-08-30 13:55:19,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 915 places, 4084 transitions, 123055 flow [2023-08-30 13:55:36,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 887 places, 4084 transitions, 118114 flow, removed 1971 selfloop flow, removed 28 redundant places. [2023-08-30 13:55:36,414 INFO L231 Difference]: Finished difference. Result has 908 places, 3748 transitions, 107854 flow [2023-08-30 13:55:36,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=91333, PETRI_DIFFERENCE_MINUEND_PLACES=811, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1329, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2064, PETRI_DIFFERENCE_SUBTRAHEND_STATES=77, PETRI_FLOW=107854, PETRI_PLACES=908, PETRI_TRANSITIONS=3748} [2023-08-30 13:55:36,417 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 876 predicate places. [2023-08-30 13:55:36,417 INFO L495 AbstractCegarLoop]: Abstraction has has 908 places, 3748 transitions, 107854 flow [2023-08-30 13:55:36,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 58.3235294117647) internal successors, (1983), 34 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:55:36,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:55:36,417 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:55:36,427 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 13:55:36,622 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 13:55:36,622 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 13:55:36,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:55:36,623 INFO L85 PathProgramCache]: Analyzing trace with hash -922414896, now seen corresponding path program 2 times [2023-08-30 13:55:36,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:55:36,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941740000] [2023-08-30 13:55:36,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:55:36,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:55:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:55:36,956 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 13:55:36,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:55:36,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941740000] [2023-08-30 13:55:36,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941740000] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:55:36,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822446223] [2023-08-30 13:55:36,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 13:55:36,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:55:36,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:55:36,957 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 13:55:36,959 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 13:55:37,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 13:55:37,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 13:55:37,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 48 conjunts are in the unsatisfiable core [2023-08-30 13:55:37,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:55:37,093 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 13:55:37,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:55:37,196 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 13:55:37,318 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 13:55:37,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 13:55:37,518 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 13:55:37,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:55:48,945 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 13:55:48,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822446223] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:55:48,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:55:48,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2023-08-30 13:55:48,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216899398] [2023-08-30 13:55:48,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:55:48,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-30 13:55:48,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:55:48,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-30 13:55:48,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=917, Unknown=6, NotChecked=0, Total=1122 [2023-08-30 13:55:51,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:55:53,167 WARN L539 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 13:55:55,185 WARN L539 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 13:55:57,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 13:55:59,270 WARN L539 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 13:56:01,428 WARN L539 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 13:56:03,552 WARN L539 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 13:56:05,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:56:07,728 WARN L539 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 13:56:09,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:56:12,027 WARN L539 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 13:56:14,145 WARN L539 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 13:56:17,225 WARN L539 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 13:56:19,326 WARN L539 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 13:56:21,445 WARN L539 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 13:56:23,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:56:25,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:56:27,591 WARN L539 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 13:56:29,710 WARN L539 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 13:56:29,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 200 [2023-08-30 13:56:29,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 908 places, 3748 transitions, 107854 flow. Second operand has 34 states, 34 states have (on average 58.3235294117647) internal successors, (1983), 34 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:56:29,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:56:29,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 200 [2023-08-30 13:56:29,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:56:31,714 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~2#1| 0) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int) (v_ArrVal_1831 Int) (v_ArrVal_1829 (Array Int Int)) (v_ArrVal_1833 Int)) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_1829) |c_~#cache~0.base|))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_47| |c_#StackHeapBarrier|) (< (+ (select .cse0 |c_~#cache~0.offset|) 1) v_ArrVal_1831) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| (+ 28 |c_~#cache~0.offset|)) (< (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_1831) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| v_ArrVal_1833) |c_~#cache~0.offset|) 2147483647)))) (= |c_~#cache~0.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int) (v_ArrVal_1831 Int) (v_ArrVal_1833 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_1831)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| v_ArrVal_1833) |c_~#cache~0.offset|) 2147483647) (< (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 1) v_ArrVal_1831) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1831 Int)) (let ((.cse1 ((as const (Array Int Int)) 0))) (and (= (store .cse1 0 v_ArrVal_1831) (select |c_#memory_int| 1)) (<= v_ArrVal_1831 (+ (select .cse1 0) 1))))) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) is different from false [2023-08-30 13:56:35,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:56:35,273 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 ((as const (Array Int Int)) 0))) (let ((.cse1 (select |c_#memory_int| 1)) (.cse3 (+ (select .cse2 0) 1))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (= |c_ULTIMATE.start_main_~i~2#1| 0) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int) (v_ArrVal_1831 Int) (v_ArrVal_1829 (Array Int Int)) (v_ArrVal_1833 Int)) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_1829) |c_~#cache~0.base|))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_47| |c_#StackHeapBarrier|) (< (+ (select .cse0 |c_~#cache~0.offset|) 1) v_ArrVal_1831) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| (+ 28 |c_~#cache~0.offset|)) (< (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_1831) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| v_ArrVal_1833) |c_~#cache~0.offset|) 2147483647)))) (= |c_~#cache~0.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int) (v_ArrVal_1831 Int) (v_ArrVal_1833 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_1831)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| v_ArrVal_1833) |c_~#cache~0.offset|) 2147483647) (< (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 1) v_ArrVal_1831) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1831 Int) (v_ArrVal_1833 Int)) (and (<= 28 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= .cse1 (store (store .cse2 0 v_ArrVal_1831) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1833)) (<= v_ArrVal_1831 .cse3))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1831 Int)) (and (= (store .cse2 0 v_ArrVal_1831) .cse1) (<= v_ArrVal_1831 .cse3))) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)))) is different from false [2023-08-30 13:56:35,778 WARN L839 $PredicateComparison]: unable to prove that (let ((.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))) (and (= .cse0 (store .cse1 .cse2 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 0) (= |c_ULTIMATE.start_main_~i~2#1| 0) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int) (v_ArrVal_1831 Int) (v_ArrVal_1829 (Array Int Int)) (v_ArrVal_1833 Int)) (let ((.cse3 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_1829) |c_~#cache~0.base|))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_47| |c_#StackHeapBarrier|) (< (+ (select .cse3 |c_~#cache~0.offset|) 1) v_ArrVal_1831) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| (+ 28 |c_~#cache~0.offset|)) (< (select (store (store .cse3 |c_~#cache~0.offset| v_ArrVal_1831) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| v_ArrVal_1833) |c_~#cache~0.offset|) 2147483647)))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int) (v_ArrVal_1831 Int) (v_ArrVal_1833 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_1831)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| v_ArrVal_1833) |c_~#cache~0.offset|) 2147483647) (< (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 1) v_ArrVal_1831) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.offset| 0) (or (= .cse0 .cse1) (and (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse2)) (<= (select .cse1 .cse2) 1))) (exists ((v_ArrVal_1831 Int)) (and (= (store .cse0 0 v_ArrVal_1831) (select |c_#memory_int| 1)) (<= v_ArrVal_1831 (+ (select .cse0 0) 1))))))) is different from false [2023-08-30 13:56:38,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:56:39,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:56:41,623 WARN L539 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 13:56:42,956 WARN L839 $PredicateComparison]: unable to prove that (let ((.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)) (.cse4 (select |c_#memory_int| 1)) (.cse5 (+ (select .cse0 0) 1))) (and (= .cse0 (store .cse1 .cse2 0)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 0) (= |c_ULTIMATE.start_main_~i~2#1| 0) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int) (v_ArrVal_1831 Int) (v_ArrVal_1829 (Array Int Int)) (v_ArrVal_1833 Int)) (let ((.cse3 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_47| v_ArrVal_1829) |c_~#cache~0.base|))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_47| |c_#StackHeapBarrier|) (< (+ (select .cse3 |c_~#cache~0.offset|) 1) v_ArrVal_1831) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| (+ 28 |c_~#cache~0.offset|)) (< (select (store (store .cse3 |c_~#cache~0.offset| v_ArrVal_1831) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| v_ArrVal_1833) |c_~#cache~0.offset|) 2147483647)))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| Int) (v_ArrVal_1831 Int) (v_ArrVal_1833 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_1831)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| v_ArrVal_1833) |c_~#cache~0.offset|) 2147483647) (< (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 1) v_ArrVal_1831) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_76| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1831 Int) (v_ArrVal_1833 Int)) (and (<= 28 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= .cse4 (store (store .cse0 0 v_ArrVal_1831) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1833)) (<= v_ArrVal_1831 .cse5))) (= |c_~#cache~0.offset| 0) (or (= .cse0 .cse1) (and (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse2)) (<= (select .cse1 .cse2) 1))) (exists ((v_ArrVal_1831 Int)) (and (= (store .cse0 0 v_ArrVal_1831) .cse4) (<= v_ArrVal_1831 .cse5))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)))) is different from false [2023-08-30 13:56:45,270 WARN L539 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 13:56:55,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 13:56:58,293 WARN L539 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 13:57:00,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:57:08,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:57:12,160 WARN L539 Checker$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 13:57:15,439 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 13:57:20,651 WARN L539 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 13:57:22,731 WARN L539 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 13:57:24,735 WARN L539 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 13:57:27,014 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 13:57:33,352 WARN L539 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 13:57:36,389 WARN L539 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 13:57:40,068 WARN L539 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 13:57:44,247 WARN L539 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 13:57:46,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:57:50,661 WARN L539 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 13:57:53,734 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 13:57:55,752 WARN L539 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 13:57:57,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 [1] [2023-08-30 13:58:02,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:58:06,174 WARN L539 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 13:58:08,191 WARN L539 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 13:58:10,257 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 13:58:13,270 WARN L539 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 13:58:15,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:58:21,231 WARN L539 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 13:58:23,513 WARN L539 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 13:58:25,605 WARN L539 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 13:58:28,805 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 13:58:30,841 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 13:58:33,197 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 13:58:35,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 [1] [2023-08-30 13:58:44,969 WARN L539 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 13:58:50,612 WARN L539 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 13:58:55,747 INFO L130 PetriNetUnfolder]: 7052/15285 cut-off events. [2023-08-30 13:58:55,747 INFO L131 PetriNetUnfolder]: For 1526836/1526836 co-relation queries the response was YES. [2023-08-30 13:58:56,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245172 conditions, 15285 events. 7052/15285 cut-off events. For 1526836/1526836 co-relation queries the response was YES. Maximal size of possible extension queue 861. Compared 138843 event pairs, 752 based on Foata normal form. 128/15413 useless extension candidates. Maximal degree in co-relation 244846. Up to 9293 conditions per place. [2023-08-30 13:58:56,417 INFO L137 encePairwiseOnDemand]: 188/200 looper letters, 2681 selfloop transitions, 2585 changer transitions 0/5266 dead transitions. [2023-08-30 13:58:56,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 997 places, 5266 transitions, 169308 flow [2023-08-30 13:58:56,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2023-08-30 13:58:56,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2023-08-30 13:58:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 5528 transitions. [2023-08-30 13:58:56,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3071111111111111 [2023-08-30 13:58:56,445 INFO L72 ComplementDD]: Start complementDD. Operand 90 states and 5528 transitions. [2023-08-30 13:58:56,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 5528 transitions. [2023-08-30 13:58:56,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:58:56,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 90 states and 5528 transitions. [2023-08-30 13:58:56,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 91 states, 90 states have (on average 61.422222222222224) internal successors, (5528), 90 states have internal predecessors, (5528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:58:56,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 91 states, 91 states have (on average 200.0) internal successors, (18200), 91 states have internal predecessors, (18200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:58:56,482 INFO L81 ComplementDD]: Finished complementDD. Result has 91 states, 91 states have (on average 200.0) internal successors, (18200), 91 states have internal predecessors, (18200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:58:56,482 INFO L175 Difference]: Start difference. First operand has 908 places, 3748 transitions, 107854 flow. Second operand 90 states and 5528 transitions. [2023-08-30 13:58:56,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 997 places, 5266 transitions, 169308 flow [2023-08-30 13:59:20,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 979 places, 5266 transitions, 164993 flow, removed 2018 selfloop flow, removed 18 redundant places. [2023-08-30 13:59:20,275 INFO L231 Difference]: Finished difference. Result has 1017 places, 4786 transitions, 149324 flow [2023-08-30 13:59:20,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=105762, PETRI_DIFFERENCE_MINUEND_PLACES=890, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1701, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1945, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=149324, PETRI_PLACES=1017, PETRI_TRANSITIONS=4786} [2023-08-30 13:59:20,278 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 985 predicate places. [2023-08-30 13:59:20,278 INFO L495 AbstractCegarLoop]: Abstraction has has 1017 places, 4786 transitions, 149324 flow [2023-08-30 13:59:20,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 58.3235294117647) internal successors, (1983), 34 states have internal predecessors, (1983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:59:20,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:59:20,279 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:59:20,287 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 13:59:20,483 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 13:59:20,483 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-30 13:59:20,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:59:20,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1031112570, now seen corresponding path program 1 times [2023-08-30 13:59:20,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:59:20,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093060317] [2023-08-30 13:59:20,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:59:20,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:59:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:59:20,814 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 13:59:20,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:59:20,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093060317] [2023-08-30 13:59:20,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093060317] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:59:20,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572477298] [2023-08-30 13:59:20,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:59:20,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:59:20,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:59:20,815 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 13:59:20,817 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 13:59:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:59:20,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-30 13:59:20,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:59:20,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 13:59:21,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:59:21,036 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 13:59:21,158 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 13:59:21,289 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 13:59:21,333 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 13:59:21,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:59:29,143 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 13:59:29,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572477298] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:59:29,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:59:29,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-30 13:59:29,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702547945] [2023-08-30 13:59:29,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:59:29,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-30 13:59:29,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:59:29,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-30 13:59:29,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=991, Unknown=4, NotChecked=0, Total=1190 [2023-08-30 13:59:30,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 200 [2023-08-30 13:59:30,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1017 places, 4786 transitions, 149324 flow. Second operand has 35 states, 35 states have (on average 58.285714285714285) internal successors, (2040), 35 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:59:30,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:59:30,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 200 [2023-08-30 13:59:30,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:59:34,223 WARN L539 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 13:59:46,617 WARN L539 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 13:59:48,619 WARN L539 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 13:59:50,622 WARN L539 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 13:59:52,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:59:54,639 WARN L539 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 13:59:56,641 WARN L539 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 13:59:58,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 [0, 1] [2023-08-30 14:00:00,685 WARN L539 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 14:00:02,688 WARN L539 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 14:00:04,691 WARN L539 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 14:00:06,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 14:00:09,623 WARN L539 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 14:00:11,641 WARN L539 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 14:00:15,273 WARN L539 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 14:00:17,525 WARN L539 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 14:00:30,325 WARN L539 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 14:00:32,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 14:00:37,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 14:00:41,633 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 14:00:43,657 WARN L539 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 14:00:45,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 14:00:48,200 WARN L539 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 14:00:50,256 WARN L539 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 14:00:52,267 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 14:00:54,325 WARN L539 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 14:00:59,000 WARN L539 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 14:01:01,002 WARN L539 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 14:01:03,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 14:01:05,186 WARN L539 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 14:01:07,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 14:01:29,836 WARN L539 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 14:01:37,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 14:01:40,745 WARN L539 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 14:01:42,900 WARN L539 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 14:01:45,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 14:01:47,078 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 14:01:56,254 INFO L130 PetriNetUnfolder]: 7437/16112 cut-off events. [2023-08-30 14:01:56,254 INFO L131 PetriNetUnfolder]: For 1548083/1548083 co-relation queries the response was YES. [2023-08-30 14:01:56,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262581 conditions, 16112 events. 7437/16112 cut-off events. For 1548083/1548083 co-relation queries the response was YES. Maximal size of possible extension queue 917. Compared 148809 event pairs, 934 based on Foata normal form. 95/16207 useless extension candidates. Maximal degree in co-relation 262217. Up to 11485 conditions per place. [2023-08-30 14:01:56,614 INFO L137 encePairwiseOnDemand]: 185/200 looper letters, 3219 selfloop transitions, 2286 changer transitions 0/5505 dead transitions. [2023-08-30 14:01:56,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1072 places, 5505 transitions, 180108 flow [2023-08-30 14:01:56,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-08-30 14:01:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2023-08-30 14:01:56,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 3526 transitions. [2023-08-30 14:01:56,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30929824561403507 [2023-08-30 14:01:56,623 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 3526 transitions. [2023-08-30 14:01:56,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 3526 transitions. [2023-08-30 14:01:56,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 14:01:56,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 3526 transitions. [2023-08-30 14:01:56,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 61.85964912280702) internal successors, (3526), 57 states have internal predecessors, (3526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 14:01:56,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 200.0) internal successors, (11600), 58 states have internal predecessors, (11600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 14:01:56,631 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 200.0) internal successors, (11600), 58 states have internal predecessors, (11600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 14:01:56,632 INFO L175 Difference]: Start difference. First operand has 1017 places, 4786 transitions, 149324 flow. Second operand 57 states and 3526 transitions. [2023-08-30 14:01:56,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1072 places, 5505 transitions, 180108 flow Killed by 15