./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.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 ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 09:34:51,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 09:34:51,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 09:34:51,931 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 09:34:51,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 09:34:51,936 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 09:34:51,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 09:34:51,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 09:34:51,943 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 09:34:51,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 09:34:51,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 09:34:51,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 09:34:51,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 09:34:51,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 09:34:51,954 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 09:34:51,959 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 09:34:51,960 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 09:34:51,961 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 09:34:51,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 09:34:51,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 09:34:51,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 09:34:51,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 09:34:51,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 09:34:51,983 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 09:34:51,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 09:34:51,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 09:34:51,990 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 09:34:51,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 09:34:51,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 09:34:51,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 09:34:51,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 09:34:51,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 09:34:52,000 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 09:34:52,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 09:34:52,002 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 09:34:52,002 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 09:34:52,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 09:34:52,003 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 09:34:52,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 09:34:52,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 09:34:52,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 09:34:52,006 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-08-30 09:34:52,045 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 09:34:52,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 09:34:52,046 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 09:34:52,046 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 09:34:52,047 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 09:34:52,047 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 09:34:52,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 09:34:52,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 09:34:52,048 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 09:34:52,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 09:34:52,049 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 09:34:52,049 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 09:34:52,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 09:34:52,050 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 09:34:52,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 09:34:52,050 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 09:34:52,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 09:34:52,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 09:34:52,051 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-08-30 09:34:52,051 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 09:34:52,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 09:34:52,051 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 09:34:52,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 09:34:52,052 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 09:34:52,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 09:34:52,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 09:34:52,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 09:34:52,052 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 09:34:52,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 09:34:52,053 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 09:34:52,053 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 09:34:52,053 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 09:34:52,053 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 09:34:52,054 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 09:34:52,054 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 09:34:52,054 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 09:34:52,054 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 09:34:52,054 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 -> ebedbc62bd44b0c214a81c07c6f99e850a5d96675b77716f8547d1b39e8b2cf8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 09:34:52,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 09:34:52,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 09:34:52,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 09:34:52,385 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 09:34:52,385 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 09:34:52,386 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2023-08-30 09:34:53,486 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 09:34:53,702 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 09:34:53,702 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2023-08-30 09:34:53,717 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18dfa1db5/933c9a009771410487dac19f05cbcb07/FLAG173aca709 [2023-08-30 09:34:53,731 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18dfa1db5/933c9a009771410487dac19f05cbcb07 [2023-08-30 09:34:53,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 09:34:53,735 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 09:34:53,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 09:34:53,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 09:34:53,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 09:34:53,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 09:34:53" (1/1) ... [2023-08-30 09:34:53,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c06b42a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:34:53, skipping insertion in model container [2023-08-30 09:34:53,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 09:34:53" (1/1) ... [2023-08-30 09:34:53,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 09:34:53,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 09:34:54,121 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 09:34:54,144 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 09:34:54,182 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 09:34:54,258 INFO L208 MainTranslator]: Completed translation [2023-08-30 09:34:54,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:34:54 WrapperNode [2023-08-30 09:34:54,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 09:34:54,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 09:34:54,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 09:34:54,260 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 09:34:54,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:34:54" (1/1) ... [2023-08-30 09:34:54,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:34:54" (1/1) ... [2023-08-30 09:34:54,324 INFO L138 Inliner]: procedures = 262, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2023-08-30 09:34:54,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 09:34:54,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 09:34:54,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 09:34:54,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 09:34:54,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:34:54" (1/1) ... [2023-08-30 09:34:54,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:34:54" (1/1) ... [2023-08-30 09:34:54,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:34:54" (1/1) ... [2023-08-30 09:34:54,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:34:54" (1/1) ... [2023-08-30 09:34:54,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:34:54" (1/1) ... [2023-08-30 09:34:54,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:34:54" (1/1) ... [2023-08-30 09:34:54,364 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:34:54" (1/1) ... [2023-08-30 09:34:54,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:34:54" (1/1) ... [2023-08-30 09:34:54,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 09:34:54,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 09:34:54,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 09:34:54,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 09:34:54,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:34:54" (1/1) ... [2023-08-30 09:34:54,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 09:34:54,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:34:54,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 09:34:54,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 09:34:54,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 09:34:54,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 09:34:54,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 09:34:54,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 09:34:54,449 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 09:34:54,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 09:34:54,450 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-30 09:34:54,450 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-30 09:34:54,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 09:34:54,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 09:34:54,451 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 09:34:54,638 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 09:34:54,640 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 09:34:54,845 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 09:34:54,851 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 09:34:54,851 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-30 09:34:54,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 09:34:54 BoogieIcfgContainer [2023-08-30 09:34:54,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 09:34:54,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 09:34:54,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 09:34:54,857 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 09:34:54,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 09:34:53" (1/3) ... [2023-08-30 09:34:54,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b110b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 09:34:54, skipping insertion in model container [2023-08-30 09:34:54,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 09:34:54" (2/3) ... [2023-08-30 09:34:54,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b110b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 09:34:54, skipping insertion in model container [2023-08-30 09:34:54,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 09:34:54" (3/3) ... [2023-08-30 09:34:54,860 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2023-08-30 09:34:54,866 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 09:34:54,873 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 09:34:54,874 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-30 09:34:54,874 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 09:34:54,929 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 09:34:54,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 92 transitions, 189 flow [2023-08-30 09:34:55,026 INFO L130 PetriNetUnfolder]: 6/91 cut-off events. [2023-08-30 09:34:55,027 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 09:34:55,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 91 events. 6/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 137 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-08-30 09:34:55,033 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 92 transitions, 189 flow [2023-08-30 09:34:55,038 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 91 transitions, 185 flow [2023-08-30 09:34:55,042 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 09:34:55,059 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 91 transitions, 185 flow [2023-08-30 09:34:55,063 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 91 transitions, 185 flow [2023-08-30 09:34:55,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 91 transitions, 185 flow [2023-08-30 09:34:55,097 INFO L130 PetriNetUnfolder]: 6/91 cut-off events. [2023-08-30 09:34:55,097 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 09:34:55,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 91 events. 6/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 137 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2023-08-30 09:34:55,100 INFO L119 LiptonReduction]: Number of co-enabled transitions 2108 [2023-08-30 09:34:56,919 INFO L134 LiptonReduction]: Checked pairs total: 3013 [2023-08-30 09:34:56,919 INFO L136 LiptonReduction]: Total number of compositions: 87 [2023-08-30 09:34:56,937 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 09:34:56,944 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;@41966385, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 09:34:56,944 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-30 09:34:56,946 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2023-08-30 09:34:56,947 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 09:34:56,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:34:56,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 09:34:56,948 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:34:56,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:34:56,956 INFO L85 PathProgramCache]: Analyzing trace with hash 11425, now seen corresponding path program 1 times [2023-08-30 09:34:56,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:34:56,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45290889] [2023-08-30 09:34:56,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:34:56,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:34:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:34:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 09:34:57,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:34:57,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45290889] [2023-08-30 09:34:57,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45290889] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:34:57,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:34:57,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 09:34:57,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567534985] [2023-08-30 09:34:57,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:34:57,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 09:34:57,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:34:57,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 09:34:57,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 09:34:57,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 179 [2023-08-30 09:34:57,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 26 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:57,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:34:57,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 179 [2023-08-30 09:34:57,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:34:57,310 INFO L130 PetriNetUnfolder]: 102/206 cut-off events. [2023-08-30 09:34:57,310 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 09:34:57,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 206 events. 102/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 720 event pairs, 81 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 400. Up to 206 conditions per place. [2023-08-30 09:34:57,312 INFO L137 encePairwiseOnDemand]: 174/179 looper letters, 24 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-08-30 09:34:57,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 26 transitions, 107 flow [2023-08-30 09:34:57,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 09:34:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 09:34:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2023-08-30 09:34:57,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5251396648044693 [2023-08-30 09:34:57,325 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 282 transitions. [2023-08-30 09:34:57,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 282 transitions. [2023-08-30 09:34:57,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:34:57,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 282 transitions. [2023-08-30 09:34:57,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:57,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:57,334 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:57,335 INFO L175 Difference]: Start difference. First operand has 27 places, 26 transitions, 55 flow. Second operand 3 states and 282 transitions. [2023-08-30 09:34:57,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 26 transitions, 107 flow [2023-08-30 09:34:57,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 09:34:57,339 INFO L231 Difference]: Finished difference. Result has 28 places, 26 transitions, 66 flow [2023-08-30 09:34:57,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=28, PETRI_TRANSITIONS=26} [2023-08-30 09:34:57,343 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2023-08-30 09:34:57,343 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 26 transitions, 66 flow [2023-08-30 09:34:57,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:57,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:34:57,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 09:34:57,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 09:34:57,344 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:34:57,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:34:57,345 INFO L85 PathProgramCache]: Analyzing trace with hash 355339, now seen corresponding path program 1 times [2023-08-30 09:34:57,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:34:57,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603995477] [2023-08-30 09:34:57,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:34:57,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:34:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:34:57,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 09:34:57,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:34:57,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603995477] [2023-08-30 09:34:57,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603995477] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:34:57,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558226009] [2023-08-30 09:34:57,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:34:57,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:34:57,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:34:57,403 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:34:57,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 09:34:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:34:57,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 09:34:57,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:34:57,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 09:34:57,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 09:34:57,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558226009] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:34:57,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 09:34:57,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2023-08-30 09:34:57,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429809112] [2023-08-30 09:34:57,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:34:57,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 09:34:57,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:34:57,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 09:34:57,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 09:34:57,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 179 [2023-08-30 09:34:57,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 26 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:57,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:34:57,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 179 [2023-08-30 09:34:57,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:34:57,645 INFO L130 PetriNetUnfolder]: 102/205 cut-off events. [2023-08-30 09:34:57,645 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 09:34:57,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 205 events. 102/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 725 event pairs, 81 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 410. Up to 204 conditions per place. [2023-08-30 09:34:57,647 INFO L137 encePairwiseOnDemand]: 176/179 looper letters, 23 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2023-08-30 09:34:57,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 112 flow [2023-08-30 09:34:57,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 09:34:57,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 09:34:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 362 transitions. [2023-08-30 09:34:57,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505586592178771 [2023-08-30 09:34:57,650 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 362 transitions. [2023-08-30 09:34:57,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 362 transitions. [2023-08-30 09:34:57,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:34:57,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 362 transitions. [2023-08-30 09:34:57,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:57,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:57,654 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:57,654 INFO L175 Difference]: Start difference. First operand has 28 places, 26 transitions, 66 flow. Second operand 4 states and 362 transitions. [2023-08-30 09:34:57,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 25 transitions, 112 flow [2023-08-30 09:34:57,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 108 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 09:34:57,664 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 62 flow [2023-08-30 09:34:57,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2023-08-30 09:34:57,665 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2023-08-30 09:34:57,666 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 62 flow [2023-08-30 09:34:57,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:57,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:34:57,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:34:57,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 09:34:57,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:34:57,875 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:34:57,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:34:57,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1784505349, now seen corresponding path program 1 times [2023-08-30 09:34:57,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:34:57,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273926312] [2023-08-30 09:34:57,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:34:57,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:34:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:34:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 09:34:57,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:34:57,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273926312] [2023-08-30 09:34:57,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273926312] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:34:57,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247180993] [2023-08-30 09:34:57,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:34:57,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:34:57,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:34:57,949 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:34:57,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 09:34:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:34:58,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 09:34:58,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:34:58,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 09:34:58,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:34:58,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 09:34:58,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247180993] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:34:58,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:34:58,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 09:34:58,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796819012] [2023-08-30 09:34:58,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:34:58,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 09:34:58,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:34:58,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 09:34:58,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 09:34:58,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 179 [2023-08-30 09:34:58,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 62 flow. Second operand has 7 states, 7 states have (on average 84.71428571428571) internal successors, (593), 7 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:58,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:34:58,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 179 [2023-08-30 09:34:58,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:34:58,124 INFO L130 PetriNetUnfolder]: 102/208 cut-off events. [2023-08-30 09:34:58,124 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 09:34:58,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 208 events. 102/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 719 event pairs, 81 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 419. Up to 205 conditions per place. [2023-08-30 09:34:58,126 INFO L137 encePairwiseOnDemand]: 176/179 looper letters, 23 selfloop transitions, 5 changer transitions 0/28 dead transitions. [2023-08-30 09:34:58,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 130 flow [2023-08-30 09:34:58,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 09:34:58,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 09:34:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 529 transitions. [2023-08-30 09:34:58,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925512104283054 [2023-08-30 09:34:58,130 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 529 transitions. [2023-08-30 09:34:58,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 529 transitions. [2023-08-30 09:34:58,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:34:58,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 529 transitions. [2023-08-30 09:34:58,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:58,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:58,135 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:58,135 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 62 flow. Second operand 6 states and 529 transitions. [2023-08-30 09:34:58,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 130 flow [2023-08-30 09:34:58,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 28 transitions, 127 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 09:34:58,137 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 95 flow [2023-08-30 09:34:58,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=95, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2023-08-30 09:34:58,138 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places. [2023-08-30 09:34:58,138 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 95 flow [2023-08-30 09:34:58,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.71428571428571) internal successors, (593), 7 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:58,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:34:58,139 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-30 09:34:58,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 09:34:58,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-30 09:34:58,344 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:34:58,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:34:58,344 INFO L85 PathProgramCache]: Analyzing trace with hash -512084965, now seen corresponding path program 2 times [2023-08-30 09:34:58,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:34:58,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460015446] [2023-08-30 09:34:58,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:34:58,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:34:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:34:58,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 09:34:58,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:34:58,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460015446] [2023-08-30 09:34:58,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460015446] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:34:58,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604094451] [2023-08-30 09:34:58,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 09:34:58,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:34:58,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:34:58,447 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:34:58,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 09:34:58,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 09:34:58,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 09:34:58,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 09:34:58,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:34:58,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 09:34:58,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:34:58,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 09:34:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 09:34:58,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 09:34:58,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604094451] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:34:58,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 09:34:58,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2023-08-30 09:34:58,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133978551] [2023-08-30 09:34:58,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:34:58,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 09:34:58,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:34:58,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 09:34:58,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-30 09:34:58,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 179 [2023-08-30 09:34:58,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:58,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:34:58,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 179 [2023-08-30 09:34:58,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:34:58,819 INFO L130 PetriNetUnfolder]: 136/276 cut-off events. [2023-08-30 09:34:58,819 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 09:34:58,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 276 events. 136/276 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1082 event pairs, 24 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 565. Up to 211 conditions per place. [2023-08-30 09:34:58,824 INFO L137 encePairwiseOnDemand]: 173/179 looper letters, 42 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2023-08-30 09:34:58,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 227 flow [2023-08-30 09:34:58,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 09:34:58,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 09:34:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2023-08-30 09:34:58,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153631284916201 [2023-08-30 09:34:58,827 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 369 transitions. [2023-08-30 09:34:58,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 369 transitions. [2023-08-30 09:34:58,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:34:58,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 369 transitions. [2023-08-30 09:34:58,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:58,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:58,830 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:58,830 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 95 flow. Second operand 4 states and 369 transitions. [2023-08-30 09:34:58,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 227 flow [2023-08-30 09:34:58,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 213 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 09:34:58,833 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 115 flow [2023-08-30 09:34:58,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-08-30 09:34:58,834 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2023-08-30 09:34:58,836 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 115 flow [2023-08-30 09:34:58,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:58,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:34:58,837 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-30 09:34:58,843 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 09:34:59,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:34:59,042 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:34:59,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:34:59,042 INFO L85 PathProgramCache]: Analyzing trace with hash -512070322, now seen corresponding path program 1 times [2023-08-30 09:34:59,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:34:59,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785904001] [2023-08-30 09:34:59,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:34:59,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:34:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:34:59,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 09:34:59,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:34:59,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785904001] [2023-08-30 09:34:59,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785904001] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:34:59,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53308617] [2023-08-30 09:34:59,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:34:59,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:34:59,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:34:59,154 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:34:59,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-30 09:34:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:34:59,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 09:34:59,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:34:59,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 09:34:59,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:34:59,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 09:34:59,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53308617] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:34:59,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:34:59,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-30 09:34:59,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078629438] [2023-08-30 09:34:59,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:34:59,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 09:34:59,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:34:59,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 09:34:59,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-30 09:34:59,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 179 [2023-08-30 09:34:59,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 115 flow. Second operand has 13 states, 13 states have (on average 84.38461538461539) internal successors, (1097), 13 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:59,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:34:59,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 179 [2023-08-30 09:34:59,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:34:59,434 INFO L130 PetriNetUnfolder]: 136/282 cut-off events. [2023-08-30 09:34:59,434 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2023-08-30 09:34:59,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 282 events. 136/282 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1097 event pairs, 91 based on Foata normal form. 6/193 useless extension candidates. Maximal degree in co-relation 671. Up to 273 conditions per place. [2023-08-30 09:34:59,436 INFO L137 encePairwiseOnDemand]: 176/179 looper letters, 27 selfloop transitions, 11 changer transitions 0/38 dead transitions. [2023-08-30 09:34:59,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 227 flow [2023-08-30 09:34:59,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 09:34:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 09:34:59,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1036 transitions. [2023-08-30 09:34:59,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4823091247672253 [2023-08-30 09:34:59,439 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1036 transitions. [2023-08-30 09:34:59,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1036 transitions. [2023-08-30 09:34:59,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:34:59,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1036 transitions. [2023-08-30 09:34:59,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 86.33333333333333) internal successors, (1036), 12 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:59,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 179.0) internal successors, (2327), 13 states have internal predecessors, (2327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:59,446 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 179.0) internal successors, (2327), 13 states have internal predecessors, (2327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:59,446 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 115 flow. Second operand 12 states and 1036 transitions. [2023-08-30 09:34:59,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 227 flow [2023-08-30 09:34:59,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 38 transitions, 227 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 09:34:59,448 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 199 flow [2023-08-30 09:34:59,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=199, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2023-08-30 09:34:59,449 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 29 predicate places. [2023-08-30 09:34:59,449 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 199 flow [2023-08-30 09:34:59,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 84.38461538461539) internal successors, (1097), 13 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:59,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:34:59,450 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-08-30 09:34:59,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-30 09:34:59,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:34:59,658 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:34:59,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:34:59,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1904182542, now seen corresponding path program 2 times [2023-08-30 09:34:59,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:34:59,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882950486] [2023-08-30 09:34:59,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:34:59,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:34:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:34:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:34:59,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:34:59,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882950486] [2023-08-30 09:34:59,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882950486] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:34:59,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:34:59,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 09:34:59,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127851244] [2023-08-30 09:34:59,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:34:59,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 09:34:59,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:34:59,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 09:34:59,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 09:34:59,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 179 [2023-08-30 09:34:59,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 38 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:34:59,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:34:59,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 179 [2023-08-30 09:34:59,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:00,005 INFO L130 PetriNetUnfolder]: 126/262 cut-off events. [2023-08-30 09:35:00,005 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2023-08-30 09:35:00,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 262 events. 126/262 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 969 event pairs, 32 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 645. Up to 209 conditions per place. [2023-08-30 09:35:00,008 INFO L137 encePairwiseOnDemand]: 173/179 looper letters, 44 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2023-08-30 09:35:00,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 330 flow [2023-08-30 09:35:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 09:35:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 09:35:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2023-08-30 09:35:00,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5097765363128491 [2023-08-30 09:35:00,010 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 365 transitions. [2023-08-30 09:35:00,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 365 transitions. [2023-08-30 09:35:00,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:00,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 365 transitions. [2023-08-30 09:35:00,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:00,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:00,013 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:00,013 INFO L175 Difference]: Start difference. First operand has 56 places, 38 transitions, 199 flow. Second operand 4 states and 365 transitions. [2023-08-30 09:35:00,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 330 flow [2023-08-30 09:35:00,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 50 transitions, 282 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-30 09:35:00,019 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 183 flow [2023-08-30 09:35:00,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2023-08-30 09:35:00,021 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 29 predicate places. [2023-08-30 09:35:00,021 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 183 flow [2023-08-30 09:35:00,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:00,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:00,022 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:00,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 09:35:00,023 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:35:00,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:00,023 INFO L85 PathProgramCache]: Analyzing trace with hash 249274821, now seen corresponding path program 1 times [2023-08-30 09:35:00,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:00,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091084807] [2023-08-30 09:35:00,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:00,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:35:00,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:00,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091084807] [2023-08-30 09:35:00,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091084807] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:00,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:00,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 09:35:00,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395929191] [2023-08-30 09:35:00,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:00,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 09:35:00,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:00,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 09:35:00,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 09:35:00,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 179 [2023-08-30 09:35:00,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:00,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:00,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 179 [2023-08-30 09:35:00,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:00,190 INFO L130 PetriNetUnfolder]: 176/362 cut-off events. [2023-08-30 09:35:00,190 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2023-08-30 09:35:00,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 362 events. 176/362 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1475 event pairs, 68 based on Foata normal form. 14/289 useless extension candidates. Maximal degree in co-relation 937. Up to 219 conditions per place. [2023-08-30 09:35:00,193 INFO L137 encePairwiseOnDemand]: 174/179 looper letters, 56 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-30 09:35:00,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 58 transitions, 361 flow [2023-08-30 09:35:00,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 09:35:00,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 09:35:00,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2023-08-30 09:35:00,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5437616387337058 [2023-08-30 09:35:00,195 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 292 transitions. [2023-08-30 09:35:00,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 292 transitions. [2023-08-30 09:35:00,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:00,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 292 transitions. [2023-08-30 09:35:00,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:00,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:00,197 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:00,198 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 183 flow. Second operand 3 states and 292 transitions. [2023-08-30 09:35:00,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 58 transitions, 361 flow [2023-08-30 09:35:00,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 355 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 09:35:00,200 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 194 flow [2023-08-30 09:35:00,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-08-30 09:35:00,201 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 31 predicate places. [2023-08-30 09:35:00,201 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 194 flow [2023-08-30 09:35:00,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:00,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:00,202 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:00,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 09:35:00,202 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:35:00,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:00,202 INFO L85 PathProgramCache]: Analyzing trace with hash 263361348, now seen corresponding path program 1 times [2023-08-30 09:35:00,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:00,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470127458] [2023-08-30 09:35:00,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:00,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:35:00,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:00,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470127458] [2023-08-30 09:35:00,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470127458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:00,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:00,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 09:35:00,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110976744] [2023-08-30 09:35:00,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:00,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 09:35:00,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:00,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 09:35:00,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 09:35:00,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 179 [2023-08-30 09:35:00,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:00,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:00,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 179 [2023-08-30 09:35:00,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:00,368 INFO L130 PetriNetUnfolder]: 238/486 cut-off events. [2023-08-30 09:35:00,368 INFO L131 PetriNetUnfolder]: For 243/243 co-relation queries the response was YES. [2023-08-30 09:35:00,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1378 conditions, 486 events. 238/486 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2002 event pairs, 127 based on Foata normal form. 14/384 useless extension candidates. Maximal degree in co-relation 1349. Up to 333 conditions per place. [2023-08-30 09:35:00,371 INFO L137 encePairwiseOnDemand]: 174/179 looper letters, 58 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-30 09:35:00,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 60 transitions, 391 flow [2023-08-30 09:35:00,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 09:35:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 09:35:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2023-08-30 09:35:00,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5493482309124768 [2023-08-30 09:35:00,373 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 295 transitions. [2023-08-30 09:35:00,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 295 transitions. [2023-08-30 09:35:00,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:00,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 295 transitions. [2023-08-30 09:35:00,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:00,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:00,376 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:00,376 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 194 flow. Second operand 3 states and 295 transitions. [2023-08-30 09:35:00,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 60 transitions, 391 flow [2023-08-30 09:35:00,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 387 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 09:35:00,378 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 208 flow [2023-08-30 09:35:00,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2023-08-30 09:35:00,379 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 33 predicate places. [2023-08-30 09:35:00,379 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 208 flow [2023-08-30 09:35:00,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:00,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:00,380 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:00,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 09:35:00,380 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:35:00,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:00,381 INFO L85 PathProgramCache]: Analyzing trace with hash -964451862, now seen corresponding path program 1 times [2023-08-30 09:35:00,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:00,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10885768] [2023-08-30 09:35:00,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:00,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:35:00,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:00,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10885768] [2023-08-30 09:35:00,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10885768] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:00,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:00,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 09:35:00,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349037911] [2023-08-30 09:35:00,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:00,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 09:35:00,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:00,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 09:35:00,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 09:35:00,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 179 [2023-08-30 09:35:00,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 42 transitions, 208 flow. Second operand has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:00,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:00,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 179 [2023-08-30 09:35:00,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:01,059 INFO L130 PetriNetUnfolder]: 264/550 cut-off events. [2023-08-30 09:35:01,060 INFO L131 PetriNetUnfolder]: For 299/299 co-relation queries the response was YES. [2023-08-30 09:35:01,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 550 events. 264/550 cut-off events. For 299/299 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2412 event pairs, 115 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 1628. Up to 428 conditions per place. [2023-08-30 09:35:01,064 INFO L137 encePairwiseOnDemand]: 170/179 looper letters, 57 selfloop transitions, 20 changer transitions 0/77 dead transitions. [2023-08-30 09:35:01,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 77 transitions, 502 flow [2023-08-30 09:35:01,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 09:35:01,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 09:35:01,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 880 transitions. [2023-08-30 09:35:01,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44692737430167595 [2023-08-30 09:35:01,067 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 880 transitions. [2023-08-30 09:35:01,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 880 transitions. [2023-08-30 09:35:01,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:01,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 880 transitions. [2023-08-30 09:35:01,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 80.0) internal successors, (880), 11 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:01,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:01,073 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:01,073 INFO L175 Difference]: Start difference. First operand has 60 places, 42 transitions, 208 flow. Second operand 11 states and 880 transitions. [2023-08-30 09:35:01,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 77 transitions, 502 flow [2023-08-30 09:35:01,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 77 transitions, 497 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 09:35:01,077 INFO L231 Difference]: Finished difference. Result has 74 places, 55 transitions, 350 flow [2023-08-30 09:35:01,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=350, PETRI_PLACES=74, PETRI_TRANSITIONS=55} [2023-08-30 09:35:01,078 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 47 predicate places. [2023-08-30 09:35:01,078 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 55 transitions, 350 flow [2023-08-30 09:35:01,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:01,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:01,078 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:01,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 09:35:01,079 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:35:01,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:01,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1213833421, now seen corresponding path program 1 times [2023-08-30 09:35:01,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:01,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993443943] [2023-08-30 09:35:01,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:01,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:01,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 09:35:01,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:01,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993443943] [2023-08-30 09:35:01,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993443943] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:01,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:01,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 09:35:01,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91358194] [2023-08-30 09:35:01,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:01,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 09:35:01,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:01,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 09:35:01,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-30 09:35:01,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 179 [2023-08-30 09:35:01,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 55 transitions, 350 flow. Second operand has 8 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:01,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:01,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 179 [2023-08-30 09:35:01,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:01,812 INFO L130 PetriNetUnfolder]: 285/618 cut-off events. [2023-08-30 09:35:01,812 INFO L131 PetriNetUnfolder]: For 874/874 co-relation queries the response was YES. [2023-08-30 09:35:01,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 618 events. 285/618 cut-off events. For 874/874 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2967 event pairs, 80 based on Foata normal form. 15/524 useless extension candidates. Maximal degree in co-relation 2133. Up to 447 conditions per place. [2023-08-30 09:35:01,816 INFO L137 encePairwiseOnDemand]: 171/179 looper letters, 69 selfloop transitions, 24 changer transitions 0/93 dead transitions. [2023-08-30 09:35:01,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 93 transitions, 706 flow [2023-08-30 09:35:01,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 09:35:01,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 09:35:01,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 899 transitions. [2023-08-30 09:35:01,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45657694261046217 [2023-08-30 09:35:01,820 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 899 transitions. [2023-08-30 09:35:01,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 899 transitions. [2023-08-30 09:35:01,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:01,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 899 transitions. [2023-08-30 09:35:01,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 81.72727272727273) internal successors, (899), 11 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:01,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:01,825 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:01,825 INFO L175 Difference]: Start difference. First operand has 74 places, 55 transitions, 350 flow. Second operand 11 states and 899 transitions. [2023-08-30 09:35:01,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 93 transitions, 706 flow [2023-08-30 09:35:01,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 93 transitions, 653 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-30 09:35:01,836 INFO L231 Difference]: Finished difference. Result has 81 places, 61 transitions, 419 flow [2023-08-30 09:35:01,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=419, PETRI_PLACES=81, PETRI_TRANSITIONS=61} [2023-08-30 09:35:01,837 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 54 predicate places. [2023-08-30 09:35:01,837 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 61 transitions, 419 flow [2023-08-30 09:35:01,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:01,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:01,838 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:01,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 09:35:01,839 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:35:01,839 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:01,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1212049482, now seen corresponding path program 2 times [2023-08-30 09:35:01,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:01,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785530490] [2023-08-30 09:35:01,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:01,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:35:02,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:02,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785530490] [2023-08-30 09:35:02,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785530490] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:02,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:02,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 09:35:02,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210454846] [2023-08-30 09:35:02,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:02,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 09:35:02,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:02,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 09:35:02,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-30 09:35:02,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 179 [2023-08-30 09:35:02,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 61 transitions, 419 flow. Second operand has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:02,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:02,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 179 [2023-08-30 09:35:02,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:02,566 INFO L130 PetriNetUnfolder]: 278/604 cut-off events. [2023-08-30 09:35:02,566 INFO L131 PetriNetUnfolder]: For 1154/1154 co-relation queries the response was YES. [2023-08-30 09:35:02,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2261 conditions, 604 events. 278/604 cut-off events. For 1154/1154 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2842 event pairs, 80 based on Foata normal form. 7/503 useless extension candidates. Maximal degree in co-relation 2224. Up to 446 conditions per place. [2023-08-30 09:35:02,571 INFO L137 encePairwiseOnDemand]: 171/179 looper letters, 68 selfloop transitions, 24 changer transitions 0/92 dead transitions. [2023-08-30 09:35:02,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 92 transitions, 725 flow [2023-08-30 09:35:02,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 09:35:02,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 09:35:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 887 transitions. [2023-08-30 09:35:02,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4504824784154393 [2023-08-30 09:35:02,574 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 887 transitions. [2023-08-30 09:35:02,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 887 transitions. [2023-08-30 09:35:02,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:02,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 887 transitions. [2023-08-30 09:35:02,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 80.63636363636364) internal successors, (887), 11 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:02,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:02,580 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:02,580 INFO L175 Difference]: Start difference. First operand has 81 places, 61 transitions, 419 flow. Second operand 11 states and 887 transitions. [2023-08-30 09:35:02,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 92 transitions, 725 flow [2023-08-30 09:35:02,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 92 transitions, 684 flow, removed 3 selfloop flow, removed 7 redundant places. [2023-08-30 09:35:02,585 INFO L231 Difference]: Finished difference. Result has 84 places, 60 transitions, 416 flow [2023-08-30 09:35:02,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=416, PETRI_PLACES=84, PETRI_TRANSITIONS=60} [2023-08-30 09:35:02,586 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 57 predicate places. [2023-08-30 09:35:02,586 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 60 transitions, 416 flow [2023-08-30 09:35:02,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:02,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:02,587 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:02,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 09:35:02,587 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:35:02,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:02,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1211471901, now seen corresponding path program 1 times [2023-08-30 09:35:02,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:02,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198275840] [2023-08-30 09:35:02,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:02,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:02,842 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:35:02,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:02,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198275840] [2023-08-30 09:35:02,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198275840] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:02,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:02,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 09:35:02,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483666908] [2023-08-30 09:35:02,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:02,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 09:35:02,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:02,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 09:35:02,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 09:35:02,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 179 [2023-08-30 09:35:02,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 60 transitions, 416 flow. Second operand has 8 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:02,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:02,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 179 [2023-08-30 09:35:02,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:03,235 INFO L130 PetriNetUnfolder]: 303/667 cut-off events. [2023-08-30 09:35:03,235 INFO L131 PetriNetUnfolder]: For 1320/1320 co-relation queries the response was YES. [2023-08-30 09:35:03,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2549 conditions, 667 events. 303/667 cut-off events. For 1320/1320 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3331 event pairs, 118 based on Foata normal form. 0/555 useless extension candidates. Maximal degree in co-relation 2512. Up to 532 conditions per place. [2023-08-30 09:35:03,241 INFO L137 encePairwiseOnDemand]: 170/179 looper letters, 69 selfloop transitions, 27 changer transitions 0/96 dead transitions. [2023-08-30 09:35:03,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 96 transitions, 835 flow [2023-08-30 09:35:03,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 09:35:03,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 09:35:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 661 transitions. [2023-08-30 09:35:03,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4615921787709497 [2023-08-30 09:35:03,248 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 661 transitions. [2023-08-30 09:35:03,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 661 transitions. [2023-08-30 09:35:03,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:03,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 661 transitions. [2023-08-30 09:35:03,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 82.625) internal successors, (661), 8 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:03,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 179.0) internal successors, (1611), 9 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:03,254 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 179.0) internal successors, (1611), 9 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:03,254 INFO L175 Difference]: Start difference. First operand has 84 places, 60 transitions, 416 flow. Second operand 8 states and 661 transitions. [2023-08-30 09:35:03,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 96 transitions, 835 flow [2023-08-30 09:35:03,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 96 transitions, 782 flow, removed 2 selfloop flow, removed 8 redundant places. [2023-08-30 09:35:03,260 INFO L231 Difference]: Finished difference. Result has 87 places, 75 transitions, 601 flow [2023-08-30 09:35:03,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=601, PETRI_PLACES=87, PETRI_TRANSITIONS=75} [2023-08-30 09:35:03,261 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 60 predicate places. [2023-08-30 09:35:03,261 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 75 transitions, 601 flow [2023-08-30 09:35:03,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:03,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:03,262 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:03,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 09:35:03,262 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:35:03,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:03,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1211471918, now seen corresponding path program 1 times [2023-08-30 09:35:03,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:03,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339733860] [2023-08-30 09:35:03,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:03,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:03,512 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:35:03,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:03,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339733860] [2023-08-30 09:35:03,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339733860] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:03,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:03,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 09:35:03,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594657739] [2023-08-30 09:35:03,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:03,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 09:35:03,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:03,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 09:35:03,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 09:35:03,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 179 [2023-08-30 09:35:03,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 75 transitions, 601 flow. Second operand has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:03,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:03,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 179 [2023-08-30 09:35:03,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:03,876 INFO L130 PetriNetUnfolder]: 296/678 cut-off events. [2023-08-30 09:35:03,877 INFO L131 PetriNetUnfolder]: For 1928/1928 co-relation queries the response was YES. [2023-08-30 09:35:03,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2909 conditions, 678 events. 296/678 cut-off events. For 1928/1928 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3536 event pairs, 116 based on Foata normal form. 7/605 useless extension candidates. Maximal degree in co-relation 2867. Up to 551 conditions per place. [2023-08-30 09:35:03,883 INFO L137 encePairwiseOnDemand]: 170/179 looper letters, 72 selfloop transitions, 30 changer transitions 0/102 dead transitions. [2023-08-30 09:35:03,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 102 transitions, 971 flow [2023-08-30 09:35:03,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 09:35:03,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 09:35:03,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 730 transitions. [2023-08-30 09:35:03,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45313469894475483 [2023-08-30 09:35:03,886 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 730 transitions. [2023-08-30 09:35:03,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 730 transitions. [2023-08-30 09:35:03,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:03,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 730 transitions. [2023-08-30 09:35:03,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 81.11111111111111) internal successors, (730), 9 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:03,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 179.0) internal successors, (1790), 10 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:03,892 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 179.0) internal successors, (1790), 10 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:03,893 INFO L175 Difference]: Start difference. First operand has 87 places, 75 transitions, 601 flow. Second operand 9 states and 730 transitions. [2023-08-30 09:35:03,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 102 transitions, 971 flow [2023-08-30 09:35:03,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 102 transitions, 933 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-30 09:35:03,900 INFO L231 Difference]: Finished difference. Result has 95 places, 80 transitions, 696 flow [2023-08-30 09:35:03,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=696, PETRI_PLACES=95, PETRI_TRANSITIONS=80} [2023-08-30 09:35:03,902 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 68 predicate places. [2023-08-30 09:35:03,903 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 80 transitions, 696 flow [2023-08-30 09:35:03,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:03,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:03,903 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:03,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 09:35:03,905 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:35:03,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:03,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1204754528, now seen corresponding path program 2 times [2023-08-30 09:35:03,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:03,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117297250] [2023-08-30 09:35:03,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:03,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:35:04,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:04,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117297250] [2023-08-30 09:35:04,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117297250] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:04,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:04,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 09:35:04,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595165353] [2023-08-30 09:35:04,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:04,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 09:35:04,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:04,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 09:35:04,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 09:35:04,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 179 [2023-08-30 09:35:04,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 80 transitions, 696 flow. Second operand has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:04,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:04,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 179 [2023-08-30 09:35:04,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:04,567 INFO L130 PetriNetUnfolder]: 322/723 cut-off events. [2023-08-30 09:35:04,568 INFO L131 PetriNetUnfolder]: For 2624/2624 co-relation queries the response was YES. [2023-08-30 09:35:04,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3261 conditions, 723 events. 322/723 cut-off events. For 2624/2624 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3760 event pairs, 126 based on Foata normal form. 8/651 useless extension candidates. Maximal degree in co-relation 3217. Up to 560 conditions per place. [2023-08-30 09:35:04,574 INFO L137 encePairwiseOnDemand]: 170/179 looper letters, 73 selfloop transitions, 42 changer transitions 0/115 dead transitions. [2023-08-30 09:35:04,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 115 transitions, 1179 flow [2023-08-30 09:35:04,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 09:35:04,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 09:35:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 880 transitions. [2023-08-30 09:35:04,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44692737430167595 [2023-08-30 09:35:04,577 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 880 transitions. [2023-08-30 09:35:04,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 880 transitions. [2023-08-30 09:35:04,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:04,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 880 transitions. [2023-08-30 09:35:04,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 80.0) internal successors, (880), 11 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:04,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:04,583 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:04,583 INFO L175 Difference]: Start difference. First operand has 95 places, 80 transitions, 696 flow. Second operand 11 states and 880 transitions. [2023-08-30 09:35:04,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 115 transitions, 1179 flow [2023-08-30 09:35:04,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 115 transitions, 1137 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-30 09:35:04,591 INFO L231 Difference]: Finished difference. Result has 105 places, 94 transitions, 953 flow [2023-08-30 09:35:04,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=953, PETRI_PLACES=105, PETRI_TRANSITIONS=94} [2023-08-30 09:35:04,592 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 78 predicate places. [2023-08-30 09:35:04,592 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 94 transitions, 953 flow [2023-08-30 09:35:04,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:04,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:04,593 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:04,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 09:35:04,593 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:35:04,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:04,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1204322061, now seen corresponding path program 2 times [2023-08-30 09:35:04,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:04,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528787226] [2023-08-30 09:35:04,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:04,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:35:04,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:04,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528787226] [2023-08-30 09:35:04,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528787226] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:04,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:04,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 09:35:04,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003940668] [2023-08-30 09:35:04,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:04,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 09:35:04,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:04,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 09:35:04,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 09:35:04,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 179 [2023-08-30 09:35:04,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 94 transitions, 953 flow. Second operand has 8 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:04,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:04,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 179 [2023-08-30 09:35:04,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:05,264 INFO L130 PetriNetUnfolder]: 333/746 cut-off events. [2023-08-30 09:35:05,264 INFO L131 PetriNetUnfolder]: For 4266/4266 co-relation queries the response was YES. [2023-08-30 09:35:05,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3797 conditions, 746 events. 333/746 cut-off events. For 4266/4266 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3921 event pairs, 127 based on Foata normal form. 7/673 useless extension candidates. Maximal degree in co-relation 3747. Up to 619 conditions per place. [2023-08-30 09:35:05,271 INFO L137 encePairwiseOnDemand]: 170/179 looper letters, 85 selfloop transitions, 34 changer transitions 0/119 dead transitions. [2023-08-30 09:35:05,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 119 transitions, 1377 flow [2023-08-30 09:35:05,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 09:35:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 09:35:05,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 814 transitions. [2023-08-30 09:35:05,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4547486033519553 [2023-08-30 09:35:05,275 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 814 transitions. [2023-08-30 09:35:05,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 814 transitions. [2023-08-30 09:35:05,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:05,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 814 transitions. [2023-08-30 09:35:05,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 81.4) internal successors, (814), 10 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:05,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 179.0) internal successors, (1969), 11 states have internal predecessors, (1969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:05,282 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 179.0) internal successors, (1969), 11 states have internal predecessors, (1969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:05,282 INFO L175 Difference]: Start difference. First operand has 105 places, 94 transitions, 953 flow. Second operand 10 states and 814 transitions. [2023-08-30 09:35:05,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 119 transitions, 1377 flow [2023-08-30 09:35:05,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 119 transitions, 1358 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-30 09:35:05,294 INFO L231 Difference]: Finished difference. Result has 113 places, 100 transitions, 1106 flow [2023-08-30 09:35:05,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1106, PETRI_PLACES=113, PETRI_TRANSITIONS=100} [2023-08-30 09:35:05,294 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 86 predicate places. [2023-08-30 09:35:05,294 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 100 transitions, 1106 flow [2023-08-30 09:35:05,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:05,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:05,295 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:05,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 09:35:05,295 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:35:05,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:05,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1204804731, now seen corresponding path program 3 times [2023-08-30 09:35:05,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:05,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274377974] [2023-08-30 09:35:05,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:05,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:05,561 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:35:05,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:05,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274377974] [2023-08-30 09:35:05,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274377974] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:05,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:05,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 09:35:05,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139308174] [2023-08-30 09:35:05,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:05,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 09:35:05,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:05,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 09:35:05,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-30 09:35:05,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 179 [2023-08-30 09:35:05,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 100 transitions, 1106 flow. Second operand has 8 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:05,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:05,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 179 [2023-08-30 09:35:05,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:05,969 INFO L130 PetriNetUnfolder]: 355/796 cut-off events. [2023-08-30 09:35:05,969 INFO L131 PetriNetUnfolder]: For 5418/5418 co-relation queries the response was YES. [2023-08-30 09:35:05,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4150 conditions, 796 events. 355/796 cut-off events. For 5418/5418 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4292 event pairs, 114 based on Foata normal form. 14/730 useless extension candidates. Maximal degree in co-relation 4097. Up to 568 conditions per place. [2023-08-30 09:35:05,978 INFO L137 encePairwiseOnDemand]: 171/179 looper letters, 85 selfloop transitions, 53 changer transitions 0/138 dead transitions. [2023-08-30 09:35:05,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 138 transitions, 1666 flow [2023-08-30 09:35:05,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 09:35:05,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 09:35:05,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 899 transitions. [2023-08-30 09:35:05,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45657694261046217 [2023-08-30 09:35:05,980 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 899 transitions. [2023-08-30 09:35:05,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 899 transitions. [2023-08-30 09:35:05,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:05,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 899 transitions. [2023-08-30 09:35:05,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 81.72727272727273) internal successors, (899), 11 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:05,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:05,986 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:05,986 INFO L175 Difference]: Start difference. First operand has 113 places, 100 transitions, 1106 flow. Second operand 11 states and 899 transitions. [2023-08-30 09:35:05,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 138 transitions, 1666 flow [2023-08-30 09:35:05,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 138 transitions, 1520 flow, removed 22 selfloop flow, removed 9 redundant places. [2023-08-30 09:35:06,001 INFO L231 Difference]: Finished difference. Result has 117 places, 107 transitions, 1227 flow [2023-08-30 09:35:06,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1227, PETRI_PLACES=117, PETRI_TRANSITIONS=107} [2023-08-30 09:35:06,002 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 90 predicate places. [2023-08-30 09:35:06,002 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 107 transitions, 1227 flow [2023-08-30 09:35:06,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 76.375) internal successors, (611), 8 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:06,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:06,003 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:06,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 09:35:06,003 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:35:06,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:06,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1204804748, now seen corresponding path program 3 times [2023-08-30 09:35:06,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:06,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411423126] [2023-08-30 09:35:06,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:06,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:06,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:35:06,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:06,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411423126] [2023-08-30 09:35:06,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411423126] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:35:06,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:35:06,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 09:35:06,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397771273] [2023-08-30 09:35:06,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:35:06,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 09:35:06,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:06,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 09:35:06,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-30 09:35:06,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 179 [2023-08-30 09:35:06,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 107 transitions, 1227 flow. Second operand has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:06,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:06,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 179 [2023-08-30 09:35:06,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:06,637 INFO L130 PetriNetUnfolder]: 348/782 cut-off events. [2023-08-30 09:35:06,637 INFO L131 PetriNetUnfolder]: For 5635/5635 co-relation queries the response was YES. [2023-08-30 09:35:06,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4214 conditions, 782 events. 348/782 cut-off events. For 5635/5635 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4146 event pairs, 114 based on Foata normal form. 7/709 useless extension candidates. Maximal degree in co-relation 4160. Up to 567 conditions per place. [2023-08-30 09:35:06,645 INFO L137 encePairwiseOnDemand]: 171/179 looper letters, 84 selfloop transitions, 52 changer transitions 0/136 dead transitions. [2023-08-30 09:35:06,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 136 transitions, 1671 flow [2023-08-30 09:35:06,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 09:35:06,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 09:35:06,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 887 transitions. [2023-08-30 09:35:06,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4504824784154393 [2023-08-30 09:35:06,648 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 887 transitions. [2023-08-30 09:35:06,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 887 transitions. [2023-08-30 09:35:06,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:06,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 887 transitions. [2023-08-30 09:35:06,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 80.63636363636364) internal successors, (887), 11 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:06,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:06,655 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:06,655 INFO L175 Difference]: Start difference. First operand has 117 places, 107 transitions, 1227 flow. Second operand 11 states and 887 transitions. [2023-08-30 09:35:06,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 136 transitions, 1671 flow [2023-08-30 09:35:06,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 136 transitions, 1588 flow, removed 7 selfloop flow, removed 7 redundant places. [2023-08-30 09:35:06,673 INFO L231 Difference]: Finished difference. Result has 120 places, 105 transitions, 1216 flow [2023-08-30 09:35:06,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1216, PETRI_PLACES=120, PETRI_TRANSITIONS=105} [2023-08-30 09:35:06,673 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 93 predicate places. [2023-08-30 09:35:06,673 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 105 transitions, 1216 flow [2023-08-30 09:35:06,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.375) internal successors, (603), 8 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:06,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:06,674 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:06,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 09:35:06,674 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:35:06,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:06,675 INFO L85 PathProgramCache]: Analyzing trace with hash -965041958, now seen corresponding path program 1 times [2023-08-30 09:35:06,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:06,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051096257] [2023-08-30 09:35:06,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:06,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:06,895 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:35:06,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:06,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051096257] [2023-08-30 09:35:06,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051096257] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:35:06,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571381190] [2023-08-30 09:35:06,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:06,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:35:06,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:35:06,897 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:35:06,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-30 09:35:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:06,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-30 09:35:06,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:35:06,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 09:35:07,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:35:07,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 09:35:07,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-30 09:35:11,162 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:35:11,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:35:15,399 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_530 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_36| Int) (v_ArrVal_529 (Array Int Int)) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39| Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_36| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39| (+ 28 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_36| v_ArrVal_529) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_40| v_ArrVal_530) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_39|) 2147483647))) is different from false [2023-08-30 09:35:15,532 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:35:15,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571381190] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:35:15,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:35:15,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2023-08-30 09:35:15,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336882130] [2023-08-30 09:35:15,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:35:15,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-30 09:35:15,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:15,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-30 09:35:15,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=216, Unknown=7, NotChecked=32, Total=342 [2023-08-30 09:35:15,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 179 [2023-08-30 09:35:15,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 105 transitions, 1216 flow. Second operand has 19 states, 19 states have (on average 66.63157894736842) internal successors, (1266), 19 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:15,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:35:15,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 179 [2023-08-30 09:35:15,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:35:17,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:18,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:22,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:26,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:27,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:32,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:33,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:35,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:36,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:35:39,752 INFO L130 PetriNetUnfolder]: 330/743 cut-off events. [2023-08-30 09:35:39,752 INFO L131 PetriNetUnfolder]: For 5463/5463 co-relation queries the response was YES. [2023-08-30 09:35:39,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3973 conditions, 743 events. 330/743 cut-off events. For 5463/5463 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3786 event pairs, 71 based on Foata normal form. 20/683 useless extension candidates. Maximal degree in co-relation 3919. Up to 496 conditions per place. [2023-08-30 09:35:39,759 INFO L137 encePairwiseOnDemand]: 172/179 looper letters, 113 selfloop transitions, 44 changer transitions 0/157 dead transitions. [2023-08-30 09:35:39,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 157 transitions, 1903 flow [2023-08-30 09:35:39,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 09:35:39,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 09:35:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 805 transitions. [2023-08-30 09:35:39,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40883697308278316 [2023-08-30 09:35:39,761 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 805 transitions. [2023-08-30 09:35:39,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 805 transitions. [2023-08-30 09:35:39,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:35:39,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 805 transitions. [2023-08-30 09:35:39,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 73.18181818181819) internal successors, (805), 11 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:39,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:39,766 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 179.0) internal successors, (2148), 12 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:39,766 INFO L175 Difference]: Start difference. First operand has 120 places, 105 transitions, 1216 flow. Second operand 11 states and 805 transitions. [2023-08-30 09:35:39,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 157 transitions, 1903 flow [2023-08-30 09:35:39,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 157 transitions, 1805 flow, removed 16 selfloop flow, removed 8 redundant places. [2023-08-30 09:35:39,780 INFO L231 Difference]: Finished difference. Result has 127 places, 117 transitions, 1400 flow [2023-08-30 09:35:39,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1400, PETRI_PLACES=127, PETRI_TRANSITIONS=117} [2023-08-30 09:35:39,781 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 100 predicate places. [2023-08-30 09:35:39,781 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 117 transitions, 1400 flow [2023-08-30 09:35:39,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 66.63157894736842) internal successors, (1266), 19 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:35:39,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:35:39,782 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:35:39,791 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 09:35:39,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-30 09:35:39,988 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:35:39,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:35:39,988 INFO L85 PathProgramCache]: Analyzing trace with hash -312793093, now seen corresponding path program 1 times [2023-08-30 09:35:39,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:35:39,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324334237] [2023-08-30 09:35:39,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:39,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:35:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:40,234 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:35:40,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:35:40,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324334237] [2023-08-30 09:35:40,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324334237] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:35:40,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935116449] [2023-08-30 09:35:40,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:35:40,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:35:40,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:35:40,237 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:35:40,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-30 09:35:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:35:40,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-30 09:35:40,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:35:40,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 09:35:40,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:35:40,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 09:35:40,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-30 09:35:44,461 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:35:44,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:35:48,633 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_37| Int) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_600 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_37| v_ArrVal_599) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_600) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_50| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| 28)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_37| |c_#StackHeapBarrier|))) is different from false [2023-08-30 09:35:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:35:48,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935116449] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:35:48,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:35:48,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2023-08-30 09:35:48,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564381781] [2023-08-30 09:35:48,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:35:48,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 09:35:48,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:35:48,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 09:35:48,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=238, Unknown=7, NotChecked=34, Total=380 [2023-08-30 09:35:50,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:35:52,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:35:54,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:35:56,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:35:58,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:36:00,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:36:02,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:36:04,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:36:06,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:36:08,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:36:10,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:36:12,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:36:14,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:36:16,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:36:18,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:36:20,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:36:22,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:36:24,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:36:26,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:36:28,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:36:30,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:36:30,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 179 [2023-08-30 09:36:30,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 117 transitions, 1400 flow. Second operand has 20 states, 20 states have (on average 61.55) internal successors, (1231), 20 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:36:30,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:36:30,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 179 [2023-08-30 09:36:30,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:36:33,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:34,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:35,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:36,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:37,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:38,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:39,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:40,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:44,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:45,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:47,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:48,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:51,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:53,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:54,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:36:57,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:37:00,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:37:01,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:37:02,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:37:07,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:37:08,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 09:37:10,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:37:12,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:37:17,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:37:19,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:37:19,756 INFO L130 PetriNetUnfolder]: 328/736 cut-off events. [2023-08-30 09:37:19,756 INFO L131 PetriNetUnfolder]: For 6549/6549 co-relation queries the response was YES. [2023-08-30 09:37:19,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4239 conditions, 736 events. 328/736 cut-off events. For 6549/6549 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3766 event pairs, 66 based on Foata normal form. 28/702 useless extension candidates. Maximal degree in co-relation 4179. Up to 408 conditions per place. [2023-08-30 09:37:19,764 INFO L137 encePairwiseOnDemand]: 171/179 looper letters, 127 selfloop transitions, 78 changer transitions 0/205 dead transitions. [2023-08-30 09:37:19,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 205 transitions, 2702 flow [2023-08-30 09:37:19,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 09:37:19,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 09:37:19,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 950 transitions. [2023-08-30 09:37:19,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790901835594573 [2023-08-30 09:37:19,767 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 950 transitions. [2023-08-30 09:37:19,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 950 transitions. [2023-08-30 09:37:19,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:37:19,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 950 transitions. [2023-08-30 09:37:19,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 67.85714285714286) internal successors, (950), 14 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:19,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 179.0) internal successors, (2685), 15 states have internal predecessors, (2685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:19,772 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 179.0) internal successors, (2685), 15 states have internal predecessors, (2685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:19,772 INFO L175 Difference]: Start difference. First operand has 127 places, 117 transitions, 1400 flow. Second operand 14 states and 950 transitions. [2023-08-30 09:37:19,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 205 transitions, 2702 flow [2023-08-30 09:37:19,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 205 transitions, 2532 flow, removed 71 selfloop flow, removed 3 redundant places. [2023-08-30 09:37:19,794 INFO L231 Difference]: Finished difference. Result has 143 places, 141 transitions, 1879 flow [2023-08-30 09:37:19,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1166, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1879, PETRI_PLACES=143, PETRI_TRANSITIONS=141} [2023-08-30 09:37:19,794 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 116 predicate places. [2023-08-30 09:37:19,795 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 141 transitions, 1879 flow [2023-08-30 09:37:19,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 61.55) internal successors, (1231), 20 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:19,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:37:19,795 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 09:37:19,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-30 09:37:20,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:37:20,001 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:37:20,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:37:20,001 INFO L85 PathProgramCache]: Analyzing trace with hash 307606274, now seen corresponding path program 1 times [2023-08-30 09:37:20,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:37:20,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909208923] [2023-08-30 09:37:20,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:37:20,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:37:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:37:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:37:20,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:37:20,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909208923] [2023-08-30 09:37:20,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909208923] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:37:20,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113523738] [2023-08-30 09:37:20,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:37:20,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:37:20,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:37:20,063 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:37:20,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-30 09:37:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:37:20,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 09:37:20,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:37:20,189 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:37:20,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 09:37:20,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113523738] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:37:20,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 09:37:20,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-08-30 09:37:20,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056621280] [2023-08-30 09:37:20,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:37:20,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 09:37:20,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:37:20,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 09:37:20,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 09:37:20,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 179 [2023-08-30 09:37:20,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 141 transitions, 1879 flow. Second operand has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:20,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:37:20,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 179 [2023-08-30 09:37:20,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:37:20,358 INFO L130 PetriNetUnfolder]: 310/696 cut-off events. [2023-08-30 09:37:20,359 INFO L131 PetriNetUnfolder]: For 6812/6812 co-relation queries the response was YES. [2023-08-30 09:37:20,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4365 conditions, 696 events. 310/696 cut-off events. For 6812/6812 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3489 event pairs, 85 based on Foata normal form. 0/677 useless extension candidates. Maximal degree in co-relation 4299. Up to 401 conditions per place. [2023-08-30 09:37:20,371 INFO L137 encePairwiseOnDemand]: 176/179 looper letters, 168 selfloop transitions, 4 changer transitions 0/172 dead transitions. [2023-08-30 09:37:20,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 172 transitions, 2534 flow [2023-08-30 09:37:20,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 09:37:20,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 09:37:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 381 transitions. [2023-08-30 09:37:20,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321229050279329 [2023-08-30 09:37:20,373 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 381 transitions. [2023-08-30 09:37:20,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 381 transitions. [2023-08-30 09:37:20,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:37:20,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 381 transitions. [2023-08-30 09:37:20,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:20,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:20,376 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:20,376 INFO L175 Difference]: Start difference. First operand has 143 places, 141 transitions, 1879 flow. Second operand 4 states and 381 transitions. [2023-08-30 09:37:20,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 172 transitions, 2534 flow [2023-08-30 09:37:20,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 172 transitions, 2411 flow, removed 38 selfloop flow, removed 5 redundant places. [2023-08-30 09:37:20,402 INFO L231 Difference]: Finished difference. Result has 140 places, 140 transitions, 1796 flow [2023-08-30 09:37:20,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1788, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1796, PETRI_PLACES=140, PETRI_TRANSITIONS=140} [2023-08-30 09:37:20,403 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 113 predicate places. [2023-08-30 09:37:20,403 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 140 transitions, 1796 flow [2023-08-30 09:37:20,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:20,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:37:20,404 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 09:37:20,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-30 09:37:20,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:37:20,612 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:37:20,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:37:20,613 INFO L85 PathProgramCache]: Analyzing trace with hash 307606276, now seen corresponding path program 1 times [2023-08-30 09:37:20,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:37:20,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983043369] [2023-08-30 09:37:20,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:37:20,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:37:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:37:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 09:37:20,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:37:20,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983043369] [2023-08-30 09:37:20,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983043369] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:37:20,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:37:20,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 09:37:20,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560205347] [2023-08-30 09:37:20,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:37:20,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 09:37:20,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:37:20,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 09:37:20,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 09:37:20,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 179 [2023-08-30 09:37:20,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 140 transitions, 1796 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:20,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:37:20,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 179 [2023-08-30 09:37:20,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:37:20,794 INFO L130 PetriNetUnfolder]: 292/656 cut-off events. [2023-08-30 09:37:20,794 INFO L131 PetriNetUnfolder]: For 5925/5925 co-relation queries the response was YES. [2023-08-30 09:37:20,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4002 conditions, 656 events. 292/656 cut-off events. For 5925/5925 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3222 event pairs, 77 based on Foata normal form. 22/660 useless extension candidates. Maximal degree in co-relation 3937. Up to 502 conditions per place. [2023-08-30 09:37:20,802 INFO L137 encePairwiseOnDemand]: 175/179 looper letters, 155 selfloop transitions, 9 changer transitions 0/164 dead transitions. [2023-08-30 09:37:20,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 164 transitions, 2337 flow [2023-08-30 09:37:20,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 09:37:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 09:37:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2023-08-30 09:37:20,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.521415270018622 [2023-08-30 09:37:20,804 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2023-08-30 09:37:20,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2023-08-30 09:37:20,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:37:20,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2023-08-30 09:37:20,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:20,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:20,806 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:20,806 INFO L175 Difference]: Start difference. First operand has 140 places, 140 transitions, 1796 flow. Second operand 3 states and 280 transitions. [2023-08-30 09:37:20,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 164 transitions, 2337 flow [2023-08-30 09:37:20,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 164 transitions, 2330 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 09:37:20,828 INFO L231 Difference]: Finished difference. Result has 140 places, 140 transitions, 1820 flow [2023-08-30 09:37:20,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1785, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1820, PETRI_PLACES=140, PETRI_TRANSITIONS=140} [2023-08-30 09:37:20,829 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 113 predicate places. [2023-08-30 09:37:20,829 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 140 transitions, 1820 flow [2023-08-30 09:37:20,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:20,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:37:20,829 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 09:37:20,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 09:37:20,830 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:37:20,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:37:20,830 INFO L85 PathProgramCache]: Analyzing trace with hash 53554929, now seen corresponding path program 1 times [2023-08-30 09:37:20,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:37:20,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94794526] [2023-08-30 09:37:20,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:37:20,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:37:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:37:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:37:20,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:37:20,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94794526] [2023-08-30 09:37:20,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94794526] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:37:20,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:37:20,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 09:37:20,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279815244] [2023-08-30 09:37:20,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:37:20,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 09:37:20,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:37:20,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 09:37:20,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 09:37:20,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 179 [2023-08-30 09:37:20,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 140 transitions, 1820 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:20,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:37:20,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 179 [2023-08-30 09:37:20,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:37:21,000 INFO L130 PetriNetUnfolder]: 278/624 cut-off events. [2023-08-30 09:37:21,000 INFO L131 PetriNetUnfolder]: For 5811/5811 co-relation queries the response was YES. [2023-08-30 09:37:21,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3966 conditions, 624 events. 278/624 cut-off events. For 5811/5811 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2973 event pairs, 71 based on Foata normal form. 0/624 useless extension candidates. Maximal degree in co-relation 3901. Up to 595 conditions per place. [2023-08-30 09:37:21,007 INFO L137 encePairwiseOnDemand]: 177/179 looper letters, 151 selfloop transitions, 1 changer transitions 0/152 dead transitions. [2023-08-30 09:37:21,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 152 transitions, 2247 flow [2023-08-30 09:37:21,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 09:37:21,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 09:37:21,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2023-08-30 09:37:21,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5232774674115456 [2023-08-30 09:37:21,009 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 281 transitions. [2023-08-30 09:37:21,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 281 transitions. [2023-08-30 09:37:21,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:37:21,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 281 transitions. [2023-08-30 09:37:21,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:21,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:21,011 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:21,011 INFO L175 Difference]: Start difference. First operand has 140 places, 140 transitions, 1820 flow. Second operand 3 states and 281 transitions. [2023-08-30 09:37:21,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 152 transitions, 2247 flow [2023-08-30 09:37:21,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 152 transitions, 2233 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 09:37:21,060 INFO L231 Difference]: Finished difference. Result has 140 places, 139 transitions, 1809 flow [2023-08-30 09:37:21,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1807, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1809, PETRI_PLACES=140, PETRI_TRANSITIONS=139} [2023-08-30 09:37:21,061 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 113 predicate places. [2023-08-30 09:37:21,061 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 139 transitions, 1809 flow [2023-08-30 09:37:21,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:21,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:37:21,061 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 09:37:21,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 09:37:21,062 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:37:21,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:37:21,062 INFO L85 PathProgramCache]: Analyzing trace with hash 53554928, now seen corresponding path program 1 times [2023-08-30 09:37:21,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:37:21,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121975336] [2023-08-30 09:37:21,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:37:21,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:37:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:37:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 09:37:21,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:37:21,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121975336] [2023-08-30 09:37:21,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121975336] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:37:21,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 09:37:21,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 09:37:21,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866523915] [2023-08-30 09:37:21,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:37:21,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 09:37:21,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:37:21,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 09:37:21,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 09:37:21,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 179 [2023-08-30 09:37:21,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 139 transitions, 1809 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:21,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:37:21,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 179 [2023-08-30 09:37:21,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:37:21,228 INFO L130 PetriNetUnfolder]: 264/592 cut-off events. [2023-08-30 09:37:21,229 INFO L131 PetriNetUnfolder]: For 5385/5385 co-relation queries the response was YES. [2023-08-30 09:37:21,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3786 conditions, 592 events. 264/592 cut-off events. For 5385/5385 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2784 event pairs, 55 based on Foata normal form. 18/610 useless extension candidates. Maximal degree in co-relation 3720. Up to 450 conditions per place. [2023-08-30 09:37:21,234 INFO L137 encePairwiseOnDemand]: 175/179 looper letters, 148 selfloop transitions, 12 changer transitions 0/160 dead transitions. [2023-08-30 09:37:21,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 160 transitions, 2352 flow [2023-08-30 09:37:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 09:37:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 09:37:21,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2023-08-30 09:37:21,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5195530726256983 [2023-08-30 09:37:21,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 279 transitions. [2023-08-30 09:37:21,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 279 transitions. [2023-08-30 09:37:21,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:37:21,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 279 transitions. [2023-08-30 09:37:21,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:21,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:21,237 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:21,238 INFO L175 Difference]: Start difference. First operand has 140 places, 139 transitions, 1809 flow. Second operand 3 states and 279 transitions. [2023-08-30 09:37:21,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 160 transitions, 2352 flow [2023-08-30 09:37:21,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 160 transitions, 2349 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 09:37:21,260 INFO L231 Difference]: Finished difference. Result has 141 places, 139 transitions, 1846 flow [2023-08-30 09:37:21,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1802, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1846, PETRI_PLACES=141, PETRI_TRANSITIONS=139} [2023-08-30 09:37:21,261 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 114 predicate places. [2023-08-30 09:37:21,261 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 139 transitions, 1846 flow [2023-08-30 09:37:21,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:21,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:37:21,265 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:37:21,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-30 09:37:21,265 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:37:21,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:37:21,266 INFO L85 PathProgramCache]: Analyzing trace with hash -740167841, now seen corresponding path program 1 times [2023-08-30 09:37:21,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:37:21,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106920090] [2023-08-30 09:37:21,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:37:21,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:37:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:37:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:37:21,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:37:21,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106920090] [2023-08-30 09:37:21,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106920090] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:37:21,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966175914] [2023-08-30 09:37:21,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:37:21,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:37:21,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:37:21,645 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:37:21,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-30 09:37:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:37:21,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 09:37:21,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:37:21,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 09:37:21,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:37:21,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 09:37:21,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-30 09:37:22,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 09:37:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:37:22,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:37:22,499 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_38| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_865 Int) (v_ArrVal_862 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_38| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41| (+ 28 |c_~#cache~0.offset|)) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_38| v_ArrVal_862) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_865) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_41|) 2147483650)))) is different from false [2023-08-30 09:37:22,613 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:37:22,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966175914] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:37:22,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:37:22,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 28 [2023-08-30 09:37:22,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072674347] [2023-08-30 09:37:22,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:37:22,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 09:37:22,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:37:22,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 09:37:22,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=682, Unknown=1, NotChecked=54, Total=870 [2023-08-30 09:37:22,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 179 [2023-08-30 09:37:22,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 139 transitions, 1846 flow. Second operand has 30 states, 30 states have (on average 50.5) internal successors, (1515), 30 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:22,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:37:22,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 179 [2023-08-30 09:37:22,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:37:26,221 INFO L130 PetriNetUnfolder]: 407/891 cut-off events. [2023-08-30 09:37:26,222 INFO L131 PetriNetUnfolder]: For 11981/11981 co-relation queries the response was YES. [2023-08-30 09:37:26,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5978 conditions, 891 events. 407/891 cut-off events. For 11981/11981 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4736 event pairs, 20 based on Foata normal form. 55/946 useless extension candidates. Maximal degree in co-relation 5912. Up to 374 conditions per place. [2023-08-30 09:37:26,233 INFO L137 encePairwiseOnDemand]: 164/179 looper letters, 170 selfloop transitions, 169 changer transitions 0/339 dead transitions. [2023-08-30 09:37:26,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 339 transitions, 4886 flow [2023-08-30 09:37:26,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-08-30 09:37:26,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-08-30 09:37:26,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2022 transitions. [2023-08-30 09:37:26,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3052997131209422 [2023-08-30 09:37:26,239 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 2022 transitions. [2023-08-30 09:37:26,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 2022 transitions. [2023-08-30 09:37:26,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:37:26,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2022 transitions. [2023-08-30 09:37:26,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 54.648648648648646) internal successors, (2022), 37 states have internal predecessors, (2022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:26,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 179.0) internal successors, (6802), 38 states have internal predecessors, (6802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:26,250 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 179.0) internal successors, (6802), 38 states have internal predecessors, (6802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:26,251 INFO L175 Difference]: Start difference. First operand has 141 places, 139 transitions, 1846 flow. Second operand 37 states and 2022 transitions. [2023-08-30 09:37:26,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 339 transitions, 4886 flow [2023-08-30 09:37:26,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 339 transitions, 4729 flow, removed 34 selfloop flow, removed 3 redundant places. [2023-08-30 09:37:26,284 INFO L231 Difference]: Finished difference. Result has 196 places, 246 transitions, 4076 flow [2023-08-30 09:37:26,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1706, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=4076, PETRI_PLACES=196, PETRI_TRANSITIONS=246} [2023-08-30 09:37:26,285 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 169 predicate places. [2023-08-30 09:37:26,285 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 246 transitions, 4076 flow [2023-08-30 09:37:26,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 50.5) internal successors, (1515), 30 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:26,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:37:26,286 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:37:26,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-30 09:37:26,492 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,SelfDestructingSolverStorable23 [2023-08-30 09:37:26,492 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:37:26,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:37:26,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1296386063, now seen corresponding path program 2 times [2023-08-30 09:37:26,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:37:26,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204706715] [2023-08-30 09:37:26,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:37:26,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:37:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:37:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:37:26,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:37:26,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204706715] [2023-08-30 09:37:26,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204706715] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:37:26,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459711971] [2023-08-30 09:37:26,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 09:37:26,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:37:26,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:37:26,885 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:37:26,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-30 09:37:27,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 09:37:27,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 09:37:27,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 09:37:27,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:37:27,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 09:37:27,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:37:27,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 09:37:27,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-30 09:37:27,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 09:37:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:37:27,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:37:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:37:30,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459711971] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:37:30,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:37:30,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 28 [2023-08-30 09:37:30,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724929386] [2023-08-30 09:37:30,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:37:30,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 09:37:30,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:37:30,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 09:37:30,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=744, Unknown=6, NotChecked=0, Total=870 [2023-08-30 09:37:31,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 179 [2023-08-30 09:37:31,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 246 transitions, 4076 flow. Second operand has 30 states, 30 states have (on average 50.5) internal successors, (1515), 30 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:37:31,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:37:31,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 179 [2023-08-30 09:37:31,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:37:35,409 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 28 |c_~#cache~0.offset|)) (.cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (forall ((v_ArrVal_942 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_942) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse1))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse1) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) .cse2 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int) (v_ArrVal_944 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_944)) |c_~#cache~0.base|) .cse2 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| (+ .cse0 28 |c_~#cache~0.offset|)))) (= ((as const (Array Int Int)) 0) (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) is different from false [2023-08-30 09:37:45,176 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (forall ((v_ArrVal_942 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_942) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse0))) (= |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.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse0) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)))))) is different from false [2023-08-30 09:37:47,333 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse1 (+ 28 |c_~#cache~0.offset|)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse4 (+ .cse0 28 |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (forall ((v_ArrVal_942 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_942) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse1))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse1) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) .cse3 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int) (v_ArrVal_944 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_944)) |c_~#cache~0.base|) .cse3 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse4))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_945)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse4)))))) is different from false [2023-08-30 09:37:58,216 WARN L222 SmtUtils]: Spent 6.72s on a formula simplification. DAG size of input: 48 DAG size of output: 41 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 09:38:00,255 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (let ((.cse1 (+ 28 |c_~#cache~0.offset|)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse4 (+ .cse0 28 |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (forall ((v_ArrVal_942 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_942) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse1))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse1) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) .cse3 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int) (v_ArrVal_944 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_944)) |c_~#cache~0.base|) .cse3 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse4))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_945)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse4))) (<= 0 (+ 2147483649 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1|))))) is different from false [2023-08-30 09:38:00,927 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|)) (.cse1 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_942 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_942) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse0))) (exists ((v_ArrVal_944 Int)) (= (select |c_#memory_int| 1) (store ((as const (Array Int Int)) 0) 0 v_ArrVal_944))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse0) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) .cse1 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)))) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int) (v_ArrVal_944 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_944)) |c_~#cache~0.base|) .cse1 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) is different from false [2023-08-30 09:38:43,252 WARN L222 SmtUtils]: Spent 12.14s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 09:38:45,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:38:57,174 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 ((.cse3 (+ 28 |c_~#cache~0.offset|)) (.cse2 (@diff .cse1 .cse0)) (.cse4 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse6 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse9 (<= 0 (+ 2147483649 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1|))) (.cse7 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|))) (and (= .cse0 (store .cse1 .cse2 0)) (forall ((v_ArrVal_942 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_942) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse3))) (exists ((v_ArrVal_944 Int)) (= (select |c_#memory_int| 1) (store .cse0 0 v_ArrVal_944))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse3) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) .cse4 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)))) (or (= .cse0 .cse1) (<= (+ .cse2 28) (+ .cse5 |c_~#cache~0.offset|))) (or (and .cse6 (= (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 0)) .cse7) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int) (v_ArrVal_944 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_944)) |c_~#cache~0.base|) .cse4 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| (+ .cse5 28 |c_~#cache~0.offset|)))) (<= 0 (+ (select .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483648)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) .cse9 (or (and .cse6 .cse9) (not .cse7))))) is different from false [2023-08-30 09:38:57,204 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 ((.cse3 (+ 28 |c_~#cache~0.offset|)) (.cse2 (@diff .cse1 .cse0)) (.cse4 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse5 (* |c_ULTIMATE.start_main_~i~2#1| 28))) (and (= .cse0 (store .cse1 .cse2 0)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_942 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_942) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse3))) (exists ((v_ArrVal_944 Int)) (= (select |c_#memory_int| 1) (store .cse0 0 v_ArrVal_944))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse3) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) .cse4 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)))) (or (= .cse0 .cse1) (<= (+ .cse2 28) (+ .cse5 |c_~#cache~0.offset|))) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int) (v_ArrVal_944 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_944)) |c_~#cache~0.base|) .cse4 v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| (+ .cse5 28 |c_~#cache~0.offset|)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (<= 28 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) (<= 0 (+ 2147483649 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1|))))) is different from false [2023-08-30 09:38:59,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:39:00,261 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (forall ((v_ArrVal_942 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_942) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse0))) (= |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.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (< 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483650)) (<= 0 (+ 2147483649 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1|)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse0) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)))))) is different from false [2023-08-30 09:39:01,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:39:03,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:39:05,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:39:07,789 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 (+ 28 |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| .cse0) (forall ((v_ArrVal_942 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_942) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse1))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse0) (< 0 (+ (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_945)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| .cse1) (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|) 2147483650)))))) is different from false [2023-08-30 09:39:09,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:39:11,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:39:13,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:39:14,179 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|))) (and (forall ((v_ArrVal_942 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_942) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| (+ 28 |c_~#cache~0.offset|)))) (exists ((v_ArrVal_944 Int)) (= (select |c_#memory_int| 1) (store ((as const (Array Int Int)) 0) 0 v_ArrVal_944))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int) (v_ArrVal_944 Int)) (or (< 0 (+ 2147483650 (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_944)) |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)))) (<= 0 (+ (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483648)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) is different from false [2023-08-30 09:39:14,249 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_942 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_39| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_945 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_39| v_ArrVal_942) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_945) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43|))) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_39| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_43| (+ 28 |c_~#cache~0.offset|)))) (exists ((v_ArrVal_944 Int)) (= (select |c_#memory_int| 1) (store ((as const (Array Int Int)) 0) 0 v_ArrVal_944))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|) 2147483648)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) is different from false [2023-08-30 09:39:18,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:39:21,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:39:23,972 INFO L130 PetriNetUnfolder]: 1052/2251 cut-off events. [2023-08-30 09:39:23,972 INFO L131 PetriNetUnfolder]: For 57416/57416 co-relation queries the response was YES. [2023-08-30 09:39:23,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18295 conditions, 2251 events. 1052/2251 cut-off events. For 57416/57416 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 15098 event pairs, 103 based on Foata normal form. 87/2338 useless extension candidates. Maximal degree in co-relation 18206. Up to 835 conditions per place. [2023-08-30 09:39:24,023 INFO L137 encePairwiseOnDemand]: 162/179 looper letters, 394 selfloop transitions, 602 changer transitions 0/996 dead transitions. [2023-08-30 09:39:24,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 996 transitions, 17277 flow [2023-08-30 09:39:24,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2023-08-30 09:39:24,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2023-08-30 09:39:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 5582 transitions. [2023-08-30 09:39:24,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2998495917490331 [2023-08-30 09:39:24,033 INFO L72 ComplementDD]: Start complementDD. Operand 104 states and 5582 transitions. [2023-08-30 09:39:24,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 5582 transitions. [2023-08-30 09:39:24,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:39:24,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 104 states and 5582 transitions. [2023-08-30 09:39:24,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 105 states, 104 states have (on average 53.67307692307692) internal successors, (5582), 104 states have internal predecessors, (5582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:39:24,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 105 states, 105 states have (on average 179.0) internal successors, (18795), 105 states have internal predecessors, (18795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:39:24,063 INFO L81 ComplementDD]: Finished complementDD. Result has 105 states, 105 states have (on average 179.0) internal successors, (18795), 105 states have internal predecessors, (18795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:39:24,063 INFO L175 Difference]: Start difference. First operand has 196 places, 246 transitions, 4076 flow. Second operand 104 states and 5582 transitions. [2023-08-30 09:39:24,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 996 transitions, 17277 flow [2023-08-30 09:39:24,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 996 transitions, 15182 flow, removed 912 selfloop flow, removed 9 redundant places. [2023-08-30 09:39:24,246 INFO L231 Difference]: Finished difference. Result has 350 places, 801 transitions, 14125 flow [2023-08-30 09:39:24,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=3354, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=104, PETRI_FLOW=14125, PETRI_PLACES=350, PETRI_TRANSITIONS=801} [2023-08-30 09:39:24,247 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 323 predicate places. [2023-08-30 09:39:24,247 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 801 transitions, 14125 flow [2023-08-30 09:39:24,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 50.5) internal successors, (1515), 30 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:39:24,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:39:24,248 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:39:24,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-30 09:39:24,454 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,SelfDestructingSolverStorable24 [2023-08-30 09:39:24,454 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:39:24,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:39:24,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1780295386, now seen corresponding path program 1 times [2023-08-30 09:39:24,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:39:24,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290506738] [2023-08-30 09:39:24,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:39:24,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:39:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:39:24,929 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:39:24,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:39:24,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290506738] [2023-08-30 09:39:24,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290506738] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:39:24,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082510738] [2023-08-30 09:39:24,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:39:24,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:39:24,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:39:24,933 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:39:24,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-30 09:39:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:39:25,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 09:39:25,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:39:25,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 09:39:25,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:39:25,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 09:39:25,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-30 09:39:25,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 09:39:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:39:25,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:39:25,924 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1026 Int) (v_ArrVal_1022 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_40| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_40| v_ArrVal_1022) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1026) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_40| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| (+ 28 |c_~#cache~0.offset|)))) is different from false [2023-08-30 09:39:26,022 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:39:26,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082510738] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:39:26,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:39:26,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-08-30 09:39:26,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733214680] [2023-08-30 09:39:26,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:39:26,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 09:39:26,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:39:26,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 09:39:26,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=696, Unknown=1, NotChecked=56, Total=930 [2023-08-30 09:39:26,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 179 [2023-08-30 09:39:26,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 801 transitions, 14125 flow. Second operand has 31 states, 31 states have (on average 56.45161290322581) internal successors, (1750), 31 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:39:26,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:39:26,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 179 [2023-08-30 09:39:26,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:39:32,758 INFO L130 PetriNetUnfolder]: 1374/2941 cut-off events. [2023-08-30 09:39:32,758 INFO L131 PetriNetUnfolder]: For 137663/137663 co-relation queries the response was YES. [2023-08-30 09:39:32,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30616 conditions, 2941 events. 1374/2941 cut-off events. For 137663/137663 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 20886 event pairs, 172 based on Foata normal form. 78/3019 useless extension candidates. Maximal degree in co-relation 30466. Up to 1681 conditions per place. [2023-08-30 09:39:32,804 INFO L137 encePairwiseOnDemand]: 165/179 looper letters, 618 selfloop transitions, 573 changer transitions 2/1193 dead transitions. [2023-08-30 09:39:32,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 1193 transitions, 24228 flow [2023-08-30 09:39:32,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-30 09:39:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-30 09:39:32,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2100 transitions. [2023-08-30 09:39:32,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.345054222806441 [2023-08-30 09:39:32,808 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 2100 transitions. [2023-08-30 09:39:32,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 2100 transitions. [2023-08-30 09:39:32,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:39:32,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 2100 transitions. [2023-08-30 09:39:32,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 61.76470588235294) internal successors, (2100), 34 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:39:32,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 179.0) internal successors, (6265), 35 states have internal predecessors, (6265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:39:32,817 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 179.0) internal successors, (6265), 35 states have internal predecessors, (6265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:39:32,817 INFO L175 Difference]: Start difference. First operand has 350 places, 801 transitions, 14125 flow. Second operand 34 states and 2100 transitions. [2023-08-30 09:39:32,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 1193 transitions, 24228 flow [2023-08-30 09:39:33,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 1193 transitions, 21862 flow, removed 1178 selfloop flow, removed 1 redundant places. [2023-08-30 09:39:33,565 INFO L231 Difference]: Finished difference. Result has 405 places, 1033 transitions, 18876 flow [2023-08-30 09:39:33,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=12291, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=798, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=367, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=18876, PETRI_PLACES=405, PETRI_TRANSITIONS=1033} [2023-08-30 09:39:33,566 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 378 predicate places. [2023-08-30 09:39:33,566 INFO L495 AbstractCegarLoop]: Abstraction has has 405 places, 1033 transitions, 18876 flow [2023-08-30 09:39:33,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 56.45161290322581) internal successors, (1750), 31 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:39:33,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:39:33,567 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:39:33,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-30 09:39:33,767 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,SelfDestructingSolverStorable25 [2023-08-30 09:39:33,768 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:39:33,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:39:33,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1270924557, now seen corresponding path program 1 times [2023-08-30 09:39:33,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:39:33,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918369219] [2023-08-30 09:39:33,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:39:33,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:39:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:39:34,248 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:39:34,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:39:34,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918369219] [2023-08-30 09:39:34,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918369219] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:39:34,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773814207] [2023-08-30 09:39:34,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:39:34,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:39:34,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:39:34,250 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:39:34,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-30 09:39:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:39:34,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-30 09:39:34,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:39:34,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 09:39:34,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:39:34,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-30 09:39:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:39:34,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:39:36,880 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 09:39:36,880 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 09:39:36,890 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 09:39:36,891 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 09:39:36,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2023-08-30 09:39:36,922 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 09:39:36,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2023-08-30 09:39:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:39:37,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773814207] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:39:37,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:39:37,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-08-30 09:39:37,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560002779] [2023-08-30 09:39:37,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:39:37,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 09:39:37,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:39:37,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 09:39:37,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=811, Unknown=1, NotChecked=0, Total=930 [2023-08-30 09:39:39,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:39:41,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:39:42,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:39:44,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:39:46,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:39:48,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:39:50,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:39:52,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:39:54,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:39:56,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:39:58,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:40:00,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:40:02,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 09:40:04,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:40:06,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:40:08,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:40:10,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:40:12,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:40:14,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:40:14,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 179 [2023-08-30 09:40:14,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 1033 transitions, 18876 flow. Second operand has 31 states, 31 states have (on average 50.45161290322581) internal successors, (1564), 31 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:40:14,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:40:14,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 179 [2023-08-30 09:40:14,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:40:22,353 INFO L130 PetriNetUnfolder]: 1511/3257 cut-off events. [2023-08-30 09:40:22,353 INFO L131 PetriNetUnfolder]: For 170715/170715 co-relation queries the response was YES. [2023-08-30 09:40:22,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35376 conditions, 3257 events. 1511/3257 cut-off events. For 170715/170715 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 23955 event pairs, 158 based on Foata normal form. 17/3274 useless extension candidates. Maximal degree in co-relation 35202. Up to 1764 conditions per place. [2023-08-30 09:40:22,407 INFO L137 encePairwiseOnDemand]: 164/179 looper letters, 790 selfloop transitions, 680 changer transitions 0/1470 dead transitions. [2023-08-30 09:40:22,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 1470 transitions, 29682 flow [2023-08-30 09:40:22,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-08-30 09:40:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2023-08-30 09:40:22,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 3755 transitions. [2023-08-30 09:40:22,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2954599102997876 [2023-08-30 09:40:22,413 INFO L72 ComplementDD]: Start complementDD. Operand 71 states and 3755 transitions. [2023-08-30 09:40:22,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 3755 transitions. [2023-08-30 09:40:22,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:40:22,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 71 states and 3755 transitions. [2023-08-30 09:40:22,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 72 states, 71 states have (on average 52.88732394366197) internal successors, (3755), 71 states have internal predecessors, (3755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:40:22,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 72 states, 72 states have (on average 179.0) internal successors, (12888), 72 states have internal predecessors, (12888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:40:22,431 INFO L81 ComplementDD]: Finished complementDD. Result has 72 states, 72 states have (on average 179.0) internal successors, (12888), 72 states have internal predecessors, (12888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:40:22,431 INFO L175 Difference]: Start difference. First operand has 405 places, 1033 transitions, 18876 flow. Second operand 71 states and 3755 transitions. [2023-08-30 09:40:22,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 1470 transitions, 29682 flow [2023-08-30 09:40:23,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 1470 transitions, 28577 flow, removed 532 selfloop flow, removed 4 redundant places. [2023-08-30 09:40:23,669 INFO L231 Difference]: Finished difference. Result has 504 places, 1248 transitions, 24841 flow [2023-08-30 09:40:23,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=17882, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1029, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=485, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=24841, PETRI_PLACES=504, PETRI_TRANSITIONS=1248} [2023-08-30 09:40:23,670 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 477 predicate places. [2023-08-30 09:40:23,670 INFO L495 AbstractCegarLoop]: Abstraction has has 504 places, 1248 transitions, 24841 flow [2023-08-30 09:40:23,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 50.45161290322581) internal successors, (1564), 31 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:40:23,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:40:23,670 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:40:23,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-30 09:40:23,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-30 09:40:23,871 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:40:23,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:40:23,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1864591002, now seen corresponding path program 2 times [2023-08-30 09:40:23,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:40:23,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925210021] [2023-08-30 09:40:23,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:40:23,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:40:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:40:24,518 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:40:24,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:40:24,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925210021] [2023-08-30 09:40:24,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925210021] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:40:24,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680592513] [2023-08-30 09:40:24,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 09:40:24,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:40:24,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:40:24,520 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:40:24,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-30 09:40:24,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 09:40:24,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 09:40:24,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 09:40:24,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:40:24,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 09:40:24,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:40:24,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 09:40:24,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-30 09:40:25,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 09:40:25,099 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:40:25,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:40:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:40:25,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680592513] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:40:25,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:40:25,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2023-08-30 09:40:25,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631063657] [2023-08-30 09:40:25,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:40:25,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 09:40:25,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:40:25,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 09:40:25,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=762, Unknown=2, NotChecked=0, Total=930 [2023-08-30 09:40:27,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:40:30,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:40:30,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 179 [2023-08-30 09:40:30,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 1248 transitions, 24841 flow. Second operand has 31 states, 31 states have (on average 50.45161290322581) internal successors, (1564), 31 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:40:30,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:40:30,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 179 [2023-08-30 09:40:30,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:40:52,109 WARN L222 SmtUtils]: Spent 12.13s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 09:40:57,392 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse3 ((as const (Array Int Int)) 0))) (let ((.cse0 (@diff .cse2 .cse3))) (let ((.cse4 (store .cse2 .cse0 0)) (.cse8 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse1 (+ .cse8 |c_~#cache~0.offset|)) (.cse5 (@diff .cse4 .cse3)) (.cse7 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (or (<= (+ 28 .cse0) .cse1) (<= (select .cse2 .cse0) 1)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1181 Int)) (= (store .cse3 0 v_ArrVal_1181) (select |c_#memory_int| 1))) (= |c_~#cache~0.base| 1) (= .cse3 (store .cse4 .cse5 0)) (or (<= (+ .cse5 28) .cse1) (<= (select .cse2 .cse5) 1)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< (select (select (let ((.cse6 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1181)))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1183))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse8 28 |c_~#cache~0.offset|)))) (<= (select .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (forall ((v_ArrVal_1183 Int) (v_ArrVal_1180 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1180) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset|))))))))) is different from false [2023-08-30 09:41:00,923 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1181 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1181) (select |c_#memory_int| 1))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse0) (< (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_1181)) |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 2147483647))) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< (select (select (let ((.cse2 (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_1181)))) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1183))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse0))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (forall ((v_ArrVal_1183 Int) (v_ArrVal_1180 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1180) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset|)))))) is different from false [2023-08-30 09:41:03,351 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse4 ((as const (Array Int Int)) 0))) (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse6 (@diff .cse5 .cse4)) (.cse2 (+ .cse0 |c_~#cache~0.offset|)) (.cse3 (+ 28 |c_~#cache~0.offset|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~post32#1| 0) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ .cse0 28 |c_~#cache~0.offset|)) (< (select (store (store .cse1 .cse2 v_ArrVal_1181) |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 2147483647))) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int)) (or (< (select (store .cse1 |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse3))) (= .cse4 (store .cse5 .cse6 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse2) (or (<= (+ .cse6 28) .cse2) (= .cse4 .cse5)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((v_ArrVal_1183 Int) (v_ArrVal_1180 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1180) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse3))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= .cse4 (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))))) is different from false [2023-08-30 09:41:03,546 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse5 ((as const (Array Int Int)) 0))) (let ((.cse3 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse6 (@diff .cse1 .cse5)) (.cse0 (+ .cse9 |c_~#cache~0.offset|)) (.cse7 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse2 (+ .cse9 28 |c_~#cache~0.offset|)) (.cse4 (+ 28 |c_~#cache~0.offset|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~post32#1| 0) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse0) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1183)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 2147483647))) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse2) (< (select (store (store .cse3 .cse0 v_ArrVal_1181) |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 2147483647))) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int)) (or (< (select (store .cse3 |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse4))) (= .cse5 (store .cse1 .cse6 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0) (or (<= (+ .cse6 28) .cse0) (= .cse5 .cse1)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse2) (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1181)) |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 2147483647))) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< (select (select (let ((.cse8 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse7 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1181)))) (store .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse8 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1183))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse2))) (forall ((v_ArrVal_1183 Int) (v_ArrVal_1180 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1180) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse4))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= .cse5 (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))))) is different from false [2023-08-30 09:41:06,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:41:14,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:41:14,808 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0)) (.cse3 (+ .cse7 |c_~#cache~0.offset|)) (.cse5 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse4 (+ .cse7 28 |c_~#cache~0.offset|))) (and (= |c_ULTIMATE.start_cache_entry_addref_#t~post32#1| 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1181 Int)) (= (store .cse0 0 v_ArrVal_1181) (select |c_#memory_int| 1))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= .cse0 (store .cse1 .cse2 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse3) (= |c_~#cache~0.offset| 0) (or (<= (+ .cse2 28) .cse3) (= .cse0 .cse1)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse4) (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1181)) |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 2147483647))) (forall ((v_ArrVal_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< (select (select (let ((.cse6 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1181)))) (store .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse6 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1183))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| .cse4))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (forall ((v_ArrVal_1183 Int) (v_ArrVal_1180 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1180) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset|)))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= .cse0 (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))))) is different from false [2023-08-30 09:41:25,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 09:41:33,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:41:36,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:41:48,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:42:00,096 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 ((as const (Array Int Int)) 0)) (.cse1 (select |c_#memory_int| 1))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1181 Int)) (= (store .cse0 0 v_ArrVal_1181) .cse1)) (= |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_1183 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1181 Int)) (or (< (select (select (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1181)))) (store .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse2 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1183))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (exists ((v_ArrVal_1183 Int)) (= (store .cse0 0 v_ArrVal_1183) .cse1)) (forall ((v_ArrVal_1183 Int) (v_ArrVal_1180 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1180) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset|)))))) is different from false [2023-08-30 09:42:00,140 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.offset| 0) (<= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1) (exists ((v_ArrVal_1183 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1183) (select |c_#memory_int| 1))) (forall ((v_ArrVal_1183 Int) (v_ArrVal_1180 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1180) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset|))))) is different from false [2023-08-30 09:42:03,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:42:10,578 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (exists ((v_ArrVal_1183 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1183) (select |c_#memory_int| 1))) (forall ((v_ArrVal_1183 Int) (v_ArrVal_1180 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_41| Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_41| v_ArrVal_1180) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1183) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_41| |c_#StackHeapBarrier|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| (+ 28 |c_~#cache~0.offset|))))) is different from false [2023-08-30 09:42:20,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:42:27,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:42:37,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:42:41,696 INFO L130 PetriNetUnfolder]: 2692/5754 cut-off events. [2023-08-30 09:42:41,696 INFO L131 PetriNetUnfolder]: For 453386/453386 co-relation queries the response was YES. [2023-08-30 09:42:41,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72374 conditions, 5754 events. 2692/5754 cut-off events. For 453386/453386 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 46365 event pairs, 210 based on Foata normal form. 145/5899 useless extension candidates. Maximal degree in co-relation 72168. Up to 2262 conditions per place. [2023-08-30 09:42:41,821 INFO L137 encePairwiseOnDemand]: 162/179 looper letters, 1125 selfloop transitions, 1759 changer transitions 5/2889 dead transitions. [2023-08-30 09:42:41,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 678 places, 2889 transitions, 69813 flow [2023-08-30 09:42:41,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2023-08-30 09:42:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2023-08-30 09:42:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 9424 transitions. [2023-08-30 09:42:41,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3008459696727853 [2023-08-30 09:42:41,834 INFO L72 ComplementDD]: Start complementDD. Operand 175 states and 9424 transitions. [2023-08-30 09:42:41,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 9424 transitions. [2023-08-30 09:42:41,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:42:41,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 175 states and 9424 transitions. [2023-08-30 09:42:41,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 176 states, 175 states have (on average 53.85142857142857) internal successors, (9424), 175 states have internal predecessors, (9424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:42:41,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 176 states, 176 states have (on average 179.0) internal successors, (31504), 176 states have internal predecessors, (31504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:42:41,881 INFO L81 ComplementDD]: Finished complementDD. Result has 176 states, 176 states have (on average 179.0) internal successors, (31504), 176 states have internal predecessors, (31504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:42:41,882 INFO L175 Difference]: Start difference. First operand has 504 places, 1248 transitions, 24841 flow. Second operand 175 states and 9424 transitions. [2023-08-30 09:42:41,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 678 places, 2889 transitions, 69813 flow [2023-08-30 09:42:45,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 2889 transitions, 65206 flow, removed 2182 selfloop flow, removed 17 redundant places. [2023-08-30 09:42:45,337 INFO L231 Difference]: Finished difference. Result has 753 places, 2434 transitions, 54468 flow [2023-08-30 09:42:45,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=23157, PETRI_DIFFERENCE_MINUEND_PLACES=487, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=748, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=175, PETRI_FLOW=54468, PETRI_PLACES=753, PETRI_TRANSITIONS=2434} [2023-08-30 09:42:45,339 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 726 predicate places. [2023-08-30 09:42:45,339 INFO L495 AbstractCegarLoop]: Abstraction has has 753 places, 2434 transitions, 54468 flow [2023-08-30 09:42:45,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 50.45161290322581) internal successors, (1564), 31 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:42:45,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:42:45,340 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:42:45,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-30 09:42:45,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-30 09:42:45,544 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:42:45,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:42:45,545 INFO L85 PathProgramCache]: Analyzing trace with hash -638074801, now seen corresponding path program 1 times [2023-08-30 09:42:45,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:42:45,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714938961] [2023-08-30 09:42:45,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:42:45,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:42:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:42:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:42:46,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:42:46,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714938961] [2023-08-30 09:42:46,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714938961] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:42:46,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217689139] [2023-08-30 09:42:46,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:42:46,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:42:46,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:42:46,012 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:42:46,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-30 09:42:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:42:46,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 09:42:46,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:42:46,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 09:42:46,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:42:46,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 09:42:46,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-30 09:42:46,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 09:42:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:42:46,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:42:47,098 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1263 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1260 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1260) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1263) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|) 2147483650)))) is different from false [2023-08-30 09:42:47,220 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:42:47,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217689139] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:42:47,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:42:47,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2023-08-30 09:42:47,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714428483] [2023-08-30 09:42:47,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:42:47,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 09:42:47,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:42:47,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 09:42:47,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=711, Unknown=1, NotChecked=56, Total=930 [2023-08-30 09:42:47,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 179 [2023-08-30 09:42:47,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 753 places, 2434 transitions, 54468 flow. Second operand has 31 states, 31 states have (on average 50.45161290322581) internal successors, (1564), 31 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:42:47,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:42:47,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 179 [2023-08-30 09:42:47,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:42:50,501 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse0 (+ .cse2 28 |c_~#cache~0.offset|)) (.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse3 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((v_ArrVal_1261 Int) (v_ArrVal_1263 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| .cse0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1261)) |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1263) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))) (= (+ .cse2 |c_~#cache~0.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |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| 0) (forall ((v_ArrVal_1261 Int) (v_ArrVal_1263 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int)) (or (< 0 (+ 2147483650 (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_1261)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1263) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| .cse0))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= .cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (forall ((v_ArrVal_1261 Int) (v_ArrVal_1263 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| .cse0) (< 0 (+ 2147483650 (select (select (let ((.cse4 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1261)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1263))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))) (exists ((v_ArrVal_1261 Int)) (= (store .cse3 0 v_ArrVal_1261) (select |c_#memory_int| 1)))))) is different from false [2023-08-30 09:43:19,656 WARN L222 SmtUtils]: Spent 22.20s on a formula simplification. DAG size of input: 90 DAG size of output: 54 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 09:43:22,261 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse0 (+ .cse2 28 |c_~#cache~0.offset|)) (.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse3 ((as const (Array Int Int)) 0))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (<= 0 (+ 2147483649 |c_ULTIMATE.start_cache_entry_addref_#t~post32#1|)) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((v_ArrVal_1261 Int) (v_ArrVal_1263 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| .cse0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1261)) |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1263) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))) (= (+ .cse2 |c_~#cache~0.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |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| 0) (forall ((v_ArrVal_1261 Int) (v_ArrVal_1263 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int)) (or (< 0 (+ 2147483650 (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_1261)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1263) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| .cse0))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (= .cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (forall ((v_ArrVal_1261 Int) (v_ArrVal_1263 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64| .cse0) (< 0 (+ 2147483650 (select (select (let ((.cse4 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1261)))) (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1263))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_64|))))) (exists ((v_ArrVal_1261 Int)) (= (store .cse3 0 v_ArrVal_1261) (select |c_#memory_int| 1)))))) is different from false [2023-08-30 09:43:25,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:43:29,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:43:43,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:44:28,782 INFO L130 PetriNetUnfolder]: 3886/8333 cut-off events. [2023-08-30 09:44:28,782 INFO L131 PetriNetUnfolder]: For 1152023/1152023 co-relation queries the response was YES. [2023-08-30 09:44:28,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132814 conditions, 8333 events. 3886/8333 cut-off events. For 1152023/1152023 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 73902 event pairs, 359 based on Foata normal form. 196/8529 useless extension candidates. Maximal degree in co-relation 132522. Up to 3592 conditions per place. [2023-08-30 09:44:28,977 INFO L137 encePairwiseOnDemand]: 164/179 looper letters, 2075 selfloop transitions, 1935 changer transitions 5/4015 dead transitions. [2023-08-30 09:44:28,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 850 places, 4015 transitions, 104630 flow [2023-08-30 09:44:28,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2023-08-30 09:44:28,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2023-08-30 09:44:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 5310 transitions. [2023-08-30 09:44:28,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30270208642116064 [2023-08-30 09:44:28,985 INFO L72 ComplementDD]: Start complementDD. Operand 98 states and 5310 transitions. [2023-08-30 09:44:28,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 5310 transitions. [2023-08-30 09:44:28,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:44:28,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 98 states and 5310 transitions. [2023-08-30 09:44:28,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 99 states, 98 states have (on average 54.183673469387756) internal successors, (5310), 98 states have internal predecessors, (5310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:44:29,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 99 states, 99 states have (on average 179.0) internal successors, (17721), 99 states have internal predecessors, (17721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:44:29,007 INFO L81 ComplementDD]: Finished complementDD. Result has 99 states, 99 states have (on average 179.0) internal successors, (17721), 99 states have internal predecessors, (17721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:44:29,007 INFO L175 Difference]: Start difference. First operand has 753 places, 2434 transitions, 54468 flow. Second operand 98 states and 5310 transitions. [2023-08-30 09:44:29,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 850 places, 4015 transitions, 104630 flow [2023-08-30 09:44:41,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 827 places, 4015 transitions, 97246 flow, removed 3571 selfloop flow, removed 23 redundant places. [2023-08-30 09:44:41,164 INFO L231 Difference]: Finished difference. Result has 876 places, 3379 transitions, 83664 flow [2023-08-30 09:44:41,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=49977, PETRI_DIFFERENCE_MINUEND_PLACES=730, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1093, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1099, PETRI_DIFFERENCE_SUBTRAHEND_STATES=98, PETRI_FLOW=83664, PETRI_PLACES=876, PETRI_TRANSITIONS=3379} [2023-08-30 09:44:41,167 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 849 predicate places. [2023-08-30 09:44:41,168 INFO L495 AbstractCegarLoop]: Abstraction has has 876 places, 3379 transitions, 83664 flow [2023-08-30 09:44:41,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 50.45161290322581) internal successors, (1564), 31 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:44:41,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:44:41,168 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:44:41,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-30 09:44:41,373 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,SelfDestructingSolverStorable28 [2023-08-30 09:44:41,373 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:44:41,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:44:41,373 INFO L85 PathProgramCache]: Analyzing trace with hash 576301270, now seen corresponding path program 1 times [2023-08-30 09:44:41,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:44:41,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284712061] [2023-08-30 09:44:41,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:44:41,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:44:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:44:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:44:41,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:44:41,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284712061] [2023-08-30 09:44:41,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284712061] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:44:41,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724359476] [2023-08-30 09:44:41,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:44:41,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:44:41,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:44:41,838 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:44:41,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-30 09:44:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:44:41,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 09:44:41,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:44:41,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 09:44:42,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:44:42,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 09:44:42,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-30 09:44:42,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 09:44:42,411 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:44:42,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:44:42,858 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int) (v_ArrVal_1344 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_1340 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_43| |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| (+ 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_1340) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1344) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647))) is different from false [2023-08-30 09:44:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:44:42,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724359476] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:44:42,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:44:42,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-08-30 09:44:42,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60391668] [2023-08-30 09:44:42,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:44:42,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 09:44:42,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:44:42,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 09:44:42,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=695, Unknown=1, NotChecked=56, Total=930 [2023-08-30 09:44:43,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 179 [2023-08-30 09:44:43,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 876 places, 3379 transitions, 83664 flow. Second operand has 31 states, 31 states have (on average 56.45161290322581) internal successors, (1750), 31 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:44:43,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:44:43,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 179 [2023-08-30 09:44:43,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:45:00,567 INFO L130 PetriNetUnfolder]: 4261/9118 cut-off events. [2023-08-30 09:45:00,568 INFO L131 PetriNetUnfolder]: For 1371952/1371952 co-relation queries the response was YES. [2023-08-30 09:45:00,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152081 conditions, 9118 events. 4261/9118 cut-off events. For 1371952/1371952 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 81773 event pairs, 638 based on Foata normal form. 210/9328 useless extension candidates. Maximal degree in co-relation 151746. Up to 6860 conditions per place. [2023-08-30 09:45:00,802 INFO L137 encePairwiseOnDemand]: 164/179 looper letters, 2925 selfloop transitions, 1077 changer transitions 5/4007 dead transitions. [2023-08-30 09:45:00,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 925 places, 4007 transitions, 114271 flow [2023-08-30 09:45:00,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-08-30 09:45:00,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2023-08-30 09:45:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 3585 transitions. [2023-08-30 09:45:00,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33379888268156427 [2023-08-30 09:45:00,807 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 3585 transitions. [2023-08-30 09:45:00,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 3585 transitions. [2023-08-30 09:45:00,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:45:00,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 3585 transitions. [2023-08-30 09:45:00,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 59.75) internal successors, (3585), 60 states have internal predecessors, (3585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:45:00,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 179.0) internal successors, (10919), 61 states have internal predecessors, (10919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:45:00,821 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 179.0) internal successors, (10919), 61 states have internal predecessors, (10919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:45:00,821 INFO L175 Difference]: Start difference. First operand has 876 places, 3379 transitions, 83664 flow. Second operand 60 states and 3585 transitions. [2023-08-30 09:45:00,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 925 places, 4007 transitions, 114271 flow [2023-08-30 09:45:19,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 905 places, 4007 transitions, 103176 flow, removed 5401 selfloop flow, removed 20 redundant places. [2023-08-30 09:45:19,398 INFO L231 Difference]: Finished difference. Result has 936 places, 3707 transitions, 91462 flow [2023-08-30 09:45:19,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=75081, PETRI_DIFFERENCE_MINUEND_PLACES=846, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=750, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=91462, PETRI_PLACES=936, PETRI_TRANSITIONS=3707} [2023-08-30 09:45:19,402 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 909 predicate places. [2023-08-30 09:45:19,402 INFO L495 AbstractCegarLoop]: Abstraction has has 936 places, 3707 transitions, 91462 flow [2023-08-30 09:45:19,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 56.45161290322581) internal successors, (1750), 31 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:45:19,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:45:19,403 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:45:19,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-30 09:45:19,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:45:19,608 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:45:19,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:45:19,608 INFO L85 PathProgramCache]: Analyzing trace with hash -80026988, now seen corresponding path program 3 times [2023-08-30 09:45:19,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:45:19,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678454102] [2023-08-30 09:45:19,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:45:19,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:45:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:45:19,984 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:45:19,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:45:19,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678454102] [2023-08-30 09:45:19,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678454102] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:45:19,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567054811] [2023-08-30 09:45:19,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 09:45:19,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:45:19,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:45:19,986 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:45:19,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-30 09:45:20,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 09:45:20,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 09:45:20,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 09:45:20,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:45:20,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 09:45:20,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:45:20,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 09:45:20,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-30 09:45:20,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 09:45:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:45:20,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:45:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:45:23,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567054811] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:45:23,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:45:23,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-08-30 09:45:23,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905338485] [2023-08-30 09:45:23,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:45:23,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 09:45:23,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:45:23,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 09:45:23,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=780, Unknown=1, NotChecked=0, Total=930 [2023-08-30 09:45:24,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 179 [2023-08-30 09:45:24,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 936 places, 3707 transitions, 91462 flow. Second operand has 31 states, 31 states have (on average 56.45161290322581) internal successors, (1750), 31 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:45:24,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:45:24,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 179 [2023-08-30 09:45:24,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:45:27,611 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_1421 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1423 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1421)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1423) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 2147483647))) (= |c_~#cache~0.base| 1) (exists ((v_ArrVal_1421 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1421) (select |c_#memory_int| 1))) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1420 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1423 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1420) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1423) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (+ 28 |c_~#cache~0.offset|))))) is different from false [2023-08-30 09:45:38,918 INFO L130 PetriNetUnfolder]: 4344/9360 cut-off events. [2023-08-30 09:45:38,918 INFO L131 PetriNetUnfolder]: For 983584/983584 co-relation queries the response was YES. [2023-08-30 09:45:39,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147513 conditions, 9360 events. 4344/9360 cut-off events. For 983584/983584 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 85113 event pairs, 507 based on Foata normal form. 49/9409 useless extension candidates. Maximal degree in co-relation 147157. Up to 6207 conditions per place. [2023-08-30 09:45:39,169 INFO L137 encePairwiseOnDemand]: 165/179 looper letters, 2134 selfloop transitions, 1883 changer transitions 6/4023 dead transitions. [2023-08-30 09:45:39,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 957 places, 4023 transitions, 108261 flow [2023-08-30 09:45:39,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-30 09:45:39,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-30 09:45:39,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1593 transitions. [2023-08-30 09:45:39,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.342286205414697 [2023-08-30 09:45:39,171 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1593 transitions. [2023-08-30 09:45:39,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1593 transitions. [2023-08-30 09:45:39,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:45:39,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1593 transitions. [2023-08-30 09:45:39,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 61.26923076923077) internal successors, (1593), 26 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:45:39,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 179.0) internal successors, (4833), 27 states have internal predecessors, (4833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:45:39,177 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 179.0) internal successors, (4833), 27 states have internal predecessors, (4833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:45:39,177 INFO L175 Difference]: Start difference. First operand has 936 places, 3707 transitions, 91462 flow. Second operand 26 states and 1593 transitions. [2023-08-30 09:45:39,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 957 places, 4023 transitions, 108261 flow [2023-08-30 09:45:54,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 939 places, 4023 transitions, 105414 flow, removed 1313 selfloop flow, removed 18 redundant places. [2023-08-30 09:45:54,572 INFO L231 Difference]: Finished difference. Result has 950 places, 3877 transitions, 101011 flow [2023-08-30 09:45:54,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=88472, PETRI_DIFFERENCE_MINUEND_PLACES=914, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1715, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1923, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=101011, PETRI_PLACES=950, PETRI_TRANSITIONS=3877} [2023-08-30 09:45:54,576 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 923 predicate places. [2023-08-30 09:45:54,576 INFO L495 AbstractCegarLoop]: Abstraction has has 950 places, 3877 transitions, 101011 flow [2023-08-30 09:45:54,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 56.45161290322581) internal successors, (1750), 31 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:45:54,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:45:54,577 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:45:54,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-30 09:45:54,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:45:54,788 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:45:54,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:45:54,788 INFO L85 PathProgramCache]: Analyzing trace with hash 2103210151, now seen corresponding path program 2 times [2023-08-30 09:45:54,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:45:54,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617367087] [2023-08-30 09:45:54,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:45:54,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:45:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:45:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:45:55,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:45:55,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617367087] [2023-08-30 09:45:55,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617367087] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:45:55,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768606003] [2023-08-30 09:45:55,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 09:45:55,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:45:55,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:45:55,321 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:45:55,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-30 09:45:55,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 09:45:55,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 09:45:55,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 09:45:55,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:45:55,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 09:45:55,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:45:55,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 09:45:55,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-30 09:45:55,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 09:45:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:45:55,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:45:56,321 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| Int) (v_ArrVal_1500 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (v_ArrVal_1503 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| (+ 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1500) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1503) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72|))) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|))) is different from false [2023-08-30 09:45:56,450 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:45:56,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768606003] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:45:56,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:45:56,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 28 [2023-08-30 09:45:56,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701224023] [2023-08-30 09:45:56,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:45:56,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 09:45:56,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:45:56,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 09:45:56,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=652, Unknown=1, NotChecked=54, Total=870 [2023-08-30 09:45:56,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 179 [2023-08-30 09:45:56,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 950 places, 3877 transitions, 101011 flow. Second operand has 30 states, 30 states have (on average 50.5) internal successors, (1515), 30 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:45:56,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:45:56,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 179 [2023-08-30 09:45:56,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:46:03,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:46:07,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 09:46:29,134 INFO L130 PetriNetUnfolder]: 5511/11757 cut-off events. [2023-08-30 09:46:29,134 INFO L131 PetriNetUnfolder]: For 1427700/1427700 co-relation queries the response was YES. [2023-08-30 09:46:29,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198641 conditions, 11757 events. 5511/11757 cut-off events. For 1427700/1427700 co-relation queries the response was YES. Maximal size of possible extension queue 922. Compared 109836 event pairs, 372 based on Foata normal form. 236/11993 useless extension candidates. Maximal degree in co-relation 198298. Up to 4397 conditions per place. [2023-08-30 09:46:29,494 INFO L137 encePairwiseOnDemand]: 164/179 looper letters, 1766 selfloop transitions, 3589 changer transitions 0/5355 dead transitions. [2023-08-30 09:46:29,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1019 places, 5355 transitions, 157561 flow [2023-08-30 09:46:29,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-08-30 09:46:29,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2023-08-30 09:46:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 4949 transitions. [2023-08-30 09:46:29,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.300522224921059 [2023-08-30 09:46:29,499 INFO L72 ComplementDD]: Start complementDD. Operand 92 states and 4949 transitions. [2023-08-30 09:46:29,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 4949 transitions. [2023-08-30 09:46:29,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:46:29,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 92 states and 4949 transitions. [2023-08-30 09:46:29,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 93 states, 92 states have (on average 53.79347826086956) internal successors, (4949), 92 states have internal predecessors, (4949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:46:29,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 93 states, 93 states have (on average 179.0) internal successors, (16647), 93 states have internal predecessors, (16647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:46:29,518 INFO L81 ComplementDD]: Finished complementDD. Result has 93 states, 93 states have (on average 179.0) internal successors, (16647), 93 states have internal predecessors, (16647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:46:29,518 INFO L175 Difference]: Start difference. First operand has 950 places, 3877 transitions, 101011 flow. Second operand 92 states and 4949 transitions. [2023-08-30 09:46:29,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1019 places, 5355 transitions, 157561 flow [2023-08-30 09:46:51,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1007 places, 5355 transitions, 156262 flow, removed 352 selfloop flow, removed 12 redundant places. [2023-08-30 09:46:51,245 INFO L231 Difference]: Finished difference. Result has 1051 places, 4878 transitions, 147232 flow [2023-08-30 09:46:51,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=96639, PETRI_DIFFERENCE_MINUEND_PLACES=916, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3738, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2577, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=970, PETRI_DIFFERENCE_SUBTRAHEND_STATES=92, PETRI_FLOW=147232, PETRI_PLACES=1051, PETRI_TRANSITIONS=4878} [2023-08-30 09:46:51,253 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 1024 predicate places. [2023-08-30 09:46:51,253 INFO L495 AbstractCegarLoop]: Abstraction has has 1051 places, 4878 transitions, 147232 flow [2023-08-30 09:46:51,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 50.5) internal successors, (1515), 30 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:46:51,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:46:51,254 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:46:51,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-30 09:46:51,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:46:51,459 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:46:51,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:46:51,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2127375271, now seen corresponding path program 3 times [2023-08-30 09:46:51,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:46:51,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705143944] [2023-08-30 09:46:51,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:46:51,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:46:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:46:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:46:51,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:46:51,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705143944] [2023-08-30 09:46:51,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705143944] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:46:51,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400668742] [2023-08-30 09:46:51,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 09:46:51,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:46:51,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:46:51,889 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:46:51,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-30 09:46:52,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 09:46:52,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 09:46:52,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 09:46:52,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:46:52,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 09:46:52,165 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:46:52,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 09:46:52,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400668742] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:46:52,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 09:46:52,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 14 [2023-08-30 09:46:52,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436271532] [2023-08-30 09:46:52,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:46:52,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 09:46:52,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:46:52,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 09:46:52,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-08-30 09:46:52,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 179 [2023-08-30 09:46:52,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1051 places, 4878 transitions, 147232 flow. Second operand has 6 states, 6 states have (on average 77.5) internal successors, (465), 6 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:46:52,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:46:52,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 179 [2023-08-30 09:46:52,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:47:11,133 INFO L130 PetriNetUnfolder]: 3918/8398 cut-off events. [2023-08-30 09:47:11,133 INFO L131 PetriNetUnfolder]: For 1096728/1096728 co-relation queries the response was YES. [2023-08-30 09:47:11,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153688 conditions, 8398 events. 3918/8398 cut-off events. For 1096728/1096728 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 73913 event pairs, 754 based on Foata normal form. 6/8404 useless extension candidates. Maximal degree in co-relation 153307. Up to 7464 conditions per place. [2023-08-30 09:47:11,387 INFO L137 encePairwiseOnDemand]: 172/179 looper letters, 3388 selfloop transitions, 125 changer transitions 0/3513 dead transitions. [2023-08-30 09:47:11,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 987 places, 3513 transitions, 114168 flow [2023-08-30 09:47:11,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 09:47:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 09:47:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 497 transitions. [2023-08-30 09:47:11,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.462756052141527 [2023-08-30 09:47:11,389 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 497 transitions. [2023-08-30 09:47:11,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 497 transitions. [2023-08-30 09:47:11,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:47:11,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 497 transitions. [2023-08-30 09:47:11,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 82.83333333333333) internal successors, (497), 6 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:47:11,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:47:11,390 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:47:11,390 INFO L175 Difference]: Start difference. First operand has 1051 places, 4878 transitions, 147232 flow. Second operand 6 states and 497 transitions. [2023-08-30 09:47:11,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 987 places, 3513 transitions, 114168 flow [2023-08-30 09:47:28,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 886 places, 3513 transitions, 106721 flow, removed 3113 selfloop flow, removed 101 redundant places. [2023-08-30 09:47:28,274 INFO L231 Difference]: Finished difference. Result has 886 places, 3480 transitions, 99131 flow [2023-08-30 09:47:28,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=98881, PETRI_DIFFERENCE_MINUEND_PLACES=881, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=99131, PETRI_PLACES=886, PETRI_TRANSITIONS=3480} [2023-08-30 09:47:28,277 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 859 predicate places. [2023-08-30 09:47:28,277 INFO L495 AbstractCegarLoop]: Abstraction has has 886 places, 3480 transitions, 99131 flow [2023-08-30 09:47:28,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.5) internal successors, (465), 6 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:47:28,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:47:28,277 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:47:28,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-30 09:47:28,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:47:28,478 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:47:28,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:47:28,478 INFO L85 PathProgramCache]: Analyzing trace with hash 759163349, now seen corresponding path program 1 times [2023-08-30 09:47:28,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:47:28,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163951711] [2023-08-30 09:47:28,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:47:28,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:47:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:47:28,951 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:47:28,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:47:28,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163951711] [2023-08-30 09:47:28,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163951711] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:47:28,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197812282] [2023-08-30 09:47:28,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:47:28,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:47:28,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:47:28,957 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:47:28,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-30 09:47:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:47:29,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-30 09:47:29,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:47:29,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 09:47:29,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:47:29,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-30 09:47:29,480 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:47:29,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:47:31,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 09:47:31,699 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 09:47:31,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 09:47:31,707 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 09:47:31,718 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 09:47:31,726 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 09:47:31,726 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 09:47:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:47:31,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197812282] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:47:31,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:47:31,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-08-30 09:47:31,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472102598] [2023-08-30 09:47:31,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:47:31,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 09:47:31,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:47:31,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 09:47:31,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=808, Unknown=1, NotChecked=0, Total=930 [2023-08-30 09:47:33,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:47:35,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:47:38,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 09:47:39,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 179 [2023-08-30 09:47:39,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 886 places, 3480 transitions, 99131 flow. Second operand has 31 states, 31 states have (on average 64.45161290322581) internal successors, (1998), 31 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:47:39,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:47:39,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 179 [2023-08-30 09:47:39,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:47:57,899 INFO L130 PetriNetUnfolder]: 4329/9265 cut-off events. [2023-08-30 09:47:57,899 INFO L131 PetriNetUnfolder]: For 877403/877403 co-relation queries the response was YES. [2023-08-30 09:47:58,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153694 conditions, 9265 events. 4329/9265 cut-off events. For 877403/877403 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 83571 event pairs, 424 based on Foata normal form. 95/9360 useless extension candidates. Maximal degree in co-relation 153377. Up to 5288 conditions per place. [2023-08-30 09:47:58,146 INFO L137 encePairwiseOnDemand]: 163/179 looper letters, 2332 selfloop transitions, 1925 changer transitions 0/4257 dead transitions. [2023-08-30 09:47:58,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 964 places, 4257 transitions, 132736 flow [2023-08-30 09:47:58,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2023-08-30 09:47:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2023-08-30 09:47:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 5308 transitions. [2023-08-30 09:47:58,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3753624213280532 [2023-08-30 09:47:58,151 INFO L72 ComplementDD]: Start complementDD. Operand 79 states and 5308 transitions. [2023-08-30 09:47:58,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 5308 transitions. [2023-08-30 09:47:58,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:47:58,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 79 states and 5308 transitions. [2023-08-30 09:47:58,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 80 states, 79 states have (on average 67.18987341772151) internal successors, (5308), 79 states have internal predecessors, (5308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:47:58,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 80 states, 80 states have (on average 179.0) internal successors, (14320), 80 states have internal predecessors, (14320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:47:58,168 INFO L81 ComplementDD]: Finished complementDD. Result has 80 states, 80 states have (on average 179.0) internal successors, (14320), 80 states have internal predecessors, (14320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:47:58,168 INFO L175 Difference]: Start difference. First operand has 886 places, 3480 transitions, 99131 flow. Second operand 79 states and 5308 transitions. [2023-08-30 09:47:58,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 964 places, 4257 transitions, 132736 flow [2023-08-30 09:48:10,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 4257 transitions, 132230 flow, removed 81 selfloop flow, removed 5 redundant places. [2023-08-30 09:48:10,371 INFO L231 Difference]: Finished difference. Result has 996 places, 3886 transitions, 119552 flow [2023-08-30 09:48:10,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=98264, PETRI_DIFFERENCE_MINUEND_PLACES=881, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1544, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1791, PETRI_DIFFERENCE_SUBTRAHEND_STATES=79, PETRI_FLOW=119552, PETRI_PLACES=996, PETRI_TRANSITIONS=3886} [2023-08-30 09:48:10,373 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 969 predicate places. [2023-08-30 09:48:10,374 INFO L495 AbstractCegarLoop]: Abstraction has has 996 places, 3886 transitions, 119552 flow [2023-08-30 09:48:10,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 64.45161290322581) internal successors, (1998), 31 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:48:10,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:48:10,374 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:48:10,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-30 09:48:10,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:48:10,581 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:48:10,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:48:10,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1359507022, now seen corresponding path program 2 times [2023-08-30 09:48:10,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:48:10,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216425763] [2023-08-30 09:48:10,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:48:10,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:48:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:48:11,006 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:48:11,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:48:11,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216425763] [2023-08-30 09:48:11,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216425763] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:48:11,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318041213] [2023-08-30 09:48:11,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 09:48:11,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:48:11,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:48:11,009 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:48:11,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-30 09:48:11,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 09:48:11,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 09:48:11,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 09:48:11,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:48:11,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-30 09:48:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:48:11,308 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 09:48:11,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318041213] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 09:48:11,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 09:48:11,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 15 [2023-08-30 09:48:11,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936014971] [2023-08-30 09:48:11,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 09:48:11,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 09:48:11,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:48:11,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 09:48:11,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-08-30 09:48:11,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 179 [2023-08-30 09:48:11,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 996 places, 3886 transitions, 119552 flow. Second operand has 6 states, 6 states have (on average 77.5) internal successors, (465), 6 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:48:11,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 09:48:11,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 179 [2023-08-30 09:48:11,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 09:48:28,115 INFO L130 PetriNetUnfolder]: 4403/9438 cut-off events. [2023-08-30 09:48:28,115 INFO L131 PetriNetUnfolder]: For 999385/999385 co-relation queries the response was YES. [2023-08-30 09:48:28,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167283 conditions, 9438 events. 4403/9438 cut-off events. For 999385/999385 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 85387 event pairs, 734 based on Foata normal form. 3/9441 useless extension candidates. Maximal degree in co-relation 166929. Up to 7678 conditions per place. [2023-08-30 09:48:28,384 INFO L137 encePairwiseOnDemand]: 172/179 looper letters, 3745 selfloop transitions, 288 changer transitions 0/4033 dead transitions. [2023-08-30 09:48:28,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1001 places, 4033 transitions, 132749 flow [2023-08-30 09:48:28,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 09:48:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 09:48:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 501 transitions. [2023-08-30 09:48:28,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4664804469273743 [2023-08-30 09:48:28,385 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 501 transitions. [2023-08-30 09:48:28,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 501 transitions. [2023-08-30 09:48:28,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 09:48:28,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 501 transitions. [2023-08-30 09:48:28,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:48:28,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:48:28,387 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:48:28,387 INFO L175 Difference]: Start difference. First operand has 996 places, 3886 transitions, 119552 flow. Second operand 6 states and 501 transitions. [2023-08-30 09:48:28,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1001 places, 4033 transitions, 132749 flow [2023-08-30 09:48:46,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 982 places, 4033 transitions, 127810 flow, removed 1957 selfloop flow, removed 19 redundant places. [2023-08-30 09:48:46,231 INFO L231 Difference]: Finished difference. Result has 984 places, 3919 transitions, 116440 flow [2023-08-30 09:48:46,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=114870, PETRI_DIFFERENCE_MINUEND_PLACES=977, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3886, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=255, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116440, PETRI_PLACES=984, PETRI_TRANSITIONS=3919} [2023-08-30 09:48:46,234 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 957 predicate places. [2023-08-30 09:48:46,234 INFO L495 AbstractCegarLoop]: Abstraction has has 984 places, 3919 transitions, 116440 flow [2023-08-30 09:48:46,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.5) internal successors, (465), 6 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 09:48:46,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 09:48:46,234 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 09:48:46,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-30 09:48:46,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:48:46,435 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 09:48:46,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 09:48:46,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1523492045, now seen corresponding path program 3 times [2023-08-30 09:48:46,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 09:48:46,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376898240] [2023-08-30 09:48:46,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 09:48:46,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 09:48:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 09:48:46,867 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:48:46,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 09:48:46,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376898240] [2023-08-30 09:48:46,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376898240] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 09:48:46,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671809621] [2023-08-30 09:48:46,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 09:48:46,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 09:48:46,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 09:48:46,869 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 09:48:46,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-30 09:48:47,025 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 09:48:47,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 09:48:47,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 09:48:47,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 09:48:47,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 09:48:47,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 09:48:47,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 09:48:47,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-30 09:48:47,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 09:48:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:48:47,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 09:48:48,517 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 09:48:48,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671809621] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 09:48:48,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 09:48:48,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2023-08-30 09:48:48,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030320787] [2023-08-30 09:48:48,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 09:48:48,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 09:48:48,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 09:48:48,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 09:48:48,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=785, Unknown=6, NotChecked=0, Total=930 Killed by 15