./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 TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_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 TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 13:47:56,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 13:47:56,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 13:47:56,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 13:47:56,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 13:47:56,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 13:47:56,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 13:47:56,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 13:47:56,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 13:47:56,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 13:47:56,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 13:47:56,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 13:47:56,997 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 13:47:56,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 13:47:57,001 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 13:47:57,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 13:47:57,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 13:47:57,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 13:47:57,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 13:47:57,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 13:47:57,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 13:47:57,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 13:47:57,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 13:47:57,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 13:47:57,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 13:47:57,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 13:47:57,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 13:47:57,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 13:47:57,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 13:47:57,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 13:47:57,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 13:47:57,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 13:47:57,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 13:47:57,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 13:47:57,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 13:47:57,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 13:47:57,037 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 13:47:57,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 13:47:57,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 13:47:57,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 13:47:57,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 13:47:57,040 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-08-30 13:47:57,073 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 13:47:57,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 13:47:57,074 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 13:47:57,074 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 13:47:57,075 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 13:47:57,075 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 13:47:57,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 13:47:57,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 13:47:57,076 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 13:47:57,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 13:47:57,077 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 13:47:57,077 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 13:47:57,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 13:47:57,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 13:47:57,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 13:47:57,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 13:47:57,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 13:47:57,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 13:47:57,078 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-08-30 13:47:57,079 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 13:47:57,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 13:47:57,079 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 13:47:57,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 13:47:57,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 13:47:57,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 13:47:57,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 13:47:57,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 13:47:57,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 13:47:57,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 13:47:57,081 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 13:47:57,081 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 13:47:57,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 13:47:57,081 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 13:47:57,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 13:47:57,082 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 13:47:57,082 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 13:47:57,082 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 13:47:57,082 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 -> TOGETHER [2023-08-30 13:47:57,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 13:47:57,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 13:47:57,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 13:47:57,409 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 13:47:57,410 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 13:47:57,411 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 13:47:58,629 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 13:47:58,882 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 13:47:58,882 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2023-08-30 13:47:58,907 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ade4e77e/9fee1adc178b489d87197b19ff22ebcf/FLAG42e30c3be [2023-08-30 13:47:58,920 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ade4e77e/9fee1adc178b489d87197b19ff22ebcf [2023-08-30 13:47:58,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 13:47:58,923 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 13:47:58,925 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 13:47:58,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 13:47:58,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 13:47:58,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 01:47:58" (1/1) ... [2023-08-30 13:47:58,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@339cba16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:47:58, skipping insertion in model container [2023-08-30 13:47:58,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 01:47:58" (1/1) ... [2023-08-30 13:47:58,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 13:47:58,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 13:47:59,317 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 13:47:59,340 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 13:47:59,387 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 13:47:59,488 INFO L208 MainTranslator]: Completed translation [2023-08-30 13:47:59,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:47:59 WrapperNode [2023-08-30 13:47:59,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 13:47:59,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 13:47:59,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 13:47:59,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 13:47:59,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:47:59" (1/1) ... [2023-08-30 13:47:59,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:47:59" (1/1) ... [2023-08-30 13:47:59,548 INFO L138 Inliner]: procedures = 262, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2023-08-30 13:47:59,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 13:47:59,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 13:47:59,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 13:47:59,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 13:47:59,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:47:59" (1/1) ... [2023-08-30 13:47:59,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:47:59" (1/1) ... [2023-08-30 13:47:59,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:47:59" (1/1) ... [2023-08-30 13:47:59,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:47:59" (1/1) ... [2023-08-30 13:47:59,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:47:59" (1/1) ... [2023-08-30 13:47:59,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:47:59" (1/1) ... [2023-08-30 13:47:59,589 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:47:59" (1/1) ... [2023-08-30 13:47:59,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:47:59" (1/1) ... [2023-08-30 13:47:59,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 13:47:59,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 13:47:59,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 13:47:59,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 13:47:59,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:47:59" (1/1) ... [2023-08-30 13:47:59,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 13:47:59,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:47:59,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 13:47:59,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 13:47:59,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 13:47:59,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 13:47:59,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 13:47:59,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 13:47:59,660 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 13:47:59,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 13:47:59,661 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-30 13:47:59,661 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-30 13:47:59,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 13:47:59,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 13:47:59,662 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 13:47:59,785 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 13:47:59,786 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 13:47:59,945 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 13:47:59,951 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 13:47:59,951 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-30 13:47:59,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 01:47:59 BoogieIcfgContainer [2023-08-30 13:47:59,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 13:47:59,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 13:47:59,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 13:47:59,957 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 13:47:59,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 01:47:58" (1/3) ... [2023-08-30 13:47:59,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da4750a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 01:47:59, skipping insertion in model container [2023-08-30 13:47:59,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 01:47:59" (2/3) ... [2023-08-30 13:47:59,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da4750a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 01:47:59, skipping insertion in model container [2023-08-30 13:47:59,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 01:47:59" (3/3) ... [2023-08-30 13:47:59,959 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2023-08-30 13:47:59,984 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 13:47:59,992 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 13:47:59,993 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-30 13:47:59,993 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 13:48:00,110 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 13:48:00,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 92 transitions, 189 flow [2023-08-30 13:48:00,199 INFO L130 PetriNetUnfolder]: 6/91 cut-off events. [2023-08-30 13:48:00,201 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 13:48:00,208 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 13:48:00,208 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 92 transitions, 189 flow [2023-08-30 13:48:00,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 91 transitions, 185 flow [2023-08-30 13:48:00,218 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 13:48:00,235 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 91 transitions, 185 flow [2023-08-30 13:48:00,245 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 91 transitions, 185 flow [2023-08-30 13:48:00,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 91 transitions, 185 flow [2023-08-30 13:48:00,274 INFO L130 PetriNetUnfolder]: 6/91 cut-off events. [2023-08-30 13:48:00,274 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 13:48:00,275 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 13:48:00,276 INFO L119 LiptonReduction]: Number of co-enabled transitions 2108 [2023-08-30 13:48:01,961 INFO L134 LiptonReduction]: Checked pairs total: 3013 [2023-08-30 13:48:01,961 INFO L136 LiptonReduction]: Total number of compositions: 87 [2023-08-30 13:48:01,975 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 13:48:01,980 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;@2a40bfcc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 13:48:01,980 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-30 13:48:01,982 INFO L130 PetriNetUnfolder]: 1/2 cut-off events. [2023-08-30 13:48:01,982 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 13:48:01,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:01,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-30 13:48:01,983 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 13:48:01,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:01,988 INFO L85 PathProgramCache]: Analyzing trace with hash 11425, now seen corresponding path program 1 times [2023-08-30 13:48:01,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:01,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742922865] [2023-08-30 13:48:01,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:01,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:02,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 13:48:02,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:02,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742922865] [2023-08-30 13:48:02,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742922865] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:02,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:02,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 13:48:02,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344495249] [2023-08-30 13:48:02,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:02,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 13:48:02,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:02,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 13:48:02,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 13:48:02,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 179 [2023-08-30 13:48:02,188 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 13:48:02,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:02,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 179 [2023-08-30 13:48:02,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:02,256 INFO L130 PetriNetUnfolder]: 102/206 cut-off events. [2023-08-30 13:48:02,256 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 13:48:02,257 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 13:48:02,259 INFO L137 encePairwiseOnDemand]: 174/179 looper letters, 24 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-08-30 13:48:02,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 26 transitions, 107 flow [2023-08-30 13:48:02,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 13:48:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 13:48:02,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2023-08-30 13:48:02,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5251396648044693 [2023-08-30 13:48:02,271 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 282 transitions. [2023-08-30 13:48:02,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 282 transitions. [2023-08-30 13:48:02,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:02,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 282 transitions. [2023-08-30 13:48:02,277 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 13:48:02,281 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 13:48:02,282 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 13:48:02,283 INFO L175 Difference]: Start difference. First operand has 27 places, 26 transitions, 55 flow. Second operand 3 states and 282 transitions. [2023-08-30 13:48:02,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 26 transitions, 107 flow [2023-08-30 13:48:02,285 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 13:48:02,287 INFO L231 Difference]: Finished difference. Result has 28 places, 26 transitions, 66 flow [2023-08-30 13:48:02,288 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 13:48:02,291 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2023-08-30 13:48:02,291 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 26 transitions, 66 flow [2023-08-30 13:48:02,291 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 13:48:02,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:02,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 13:48:02,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 13:48:02,292 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 13:48:02,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:02,293 INFO L85 PathProgramCache]: Analyzing trace with hash 355339, now seen corresponding path program 1 times [2023-08-30 13:48:02,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:02,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690425008] [2023-08-30 13:48:02,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:02,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:02,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 13:48:02,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:02,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690425008] [2023-08-30 13:48:02,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690425008] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:48:02,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827137993] [2023-08-30 13:48:02,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:02,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:48:02,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:48:02,369 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 13:48:02,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 13:48:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:02,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 13:48:02,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:48:02,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 13:48:02,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 13:48:02,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827137993] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:02,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 13:48:02,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2023-08-30 13:48:02,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815924736] [2023-08-30 13:48:02,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:02,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 13:48:02,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:02,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 13:48:02,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 13:48:02,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 179 [2023-08-30 13:48:02,512 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 13:48:02,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:02,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 179 [2023-08-30 13:48:02,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:02,584 INFO L130 PetriNetUnfolder]: 102/205 cut-off events. [2023-08-30 13:48:02,585 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 13:48:02,585 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 13:48:02,586 INFO L137 encePairwiseOnDemand]: 176/179 looper letters, 23 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2023-08-30 13:48:02,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 112 flow [2023-08-30 13:48:02,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 13:48:02,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 13:48:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 362 transitions. [2023-08-30 13:48:02,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.505586592178771 [2023-08-30 13:48:02,597 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 362 transitions. [2023-08-30 13:48:02,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 362 transitions. [2023-08-30 13:48:02,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:02,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 362 transitions. [2023-08-30 13:48:02,599 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 13:48:02,602 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 13:48:02,603 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 13:48:02,603 INFO L175 Difference]: Start difference. First operand has 28 places, 26 transitions, 66 flow. Second operand 4 states and 362 transitions. [2023-08-30 13:48:02,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 25 transitions, 112 flow [2023-08-30 13:48:02,604 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 13:48:02,605 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 62 flow [2023-08-30 13:48:02,605 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 13:48:02,606 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2023-08-30 13:48:02,606 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 62 flow [2023-08-30 13:48:02,610 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 13:48:02,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:02,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:02,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 13:48:02,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:48:02,814 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 13:48:02,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:02,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1784505349, now seen corresponding path program 1 times [2023-08-30 13:48:02,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:02,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98465422] [2023-08-30 13:48:02,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:02,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:02,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 13:48:02,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:02,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98465422] [2023-08-30 13:48:02,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98465422] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:48:02,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434700167] [2023-08-30 13:48:02,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:02,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:48:02,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:48:02,897 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 13:48:02,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 13:48:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:02,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 13:48:02,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:48:02,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 13:48:02,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:48:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 13:48:03,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434700167] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:48:03,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:48:03,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 13:48:03,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487608975] [2023-08-30 13:48:03,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:48:03,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 13:48:03,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:03,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 13:48:03,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 13:48:03,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 179 [2023-08-30 13:48:03,030 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 13:48:03,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:03,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 179 [2023-08-30 13:48:03,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:03,123 INFO L130 PetriNetUnfolder]: 102/208 cut-off events. [2023-08-30 13:48:03,127 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 13:48:03,129 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 13:48:03,131 INFO L137 encePairwiseOnDemand]: 176/179 looper letters, 23 selfloop transitions, 5 changer transitions 0/28 dead transitions. [2023-08-30 13:48:03,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 130 flow [2023-08-30 13:48:03,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 13:48:03,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 13:48:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 529 transitions. [2023-08-30 13:48:03,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925512104283054 [2023-08-30 13:48:03,135 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 529 transitions. [2023-08-30 13:48:03,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 529 transitions. [2023-08-30 13:48:03,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:03,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 529 transitions. [2023-08-30 13:48:03,137 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 13:48:03,139 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 13:48:03,140 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 13:48:03,140 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 62 flow. Second operand 6 states and 529 transitions. [2023-08-30 13:48:03,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 130 flow [2023-08-30 13:48:03,140 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 13:48:03,141 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 95 flow [2023-08-30 13:48:03,141 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 13:48:03,142 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 8 predicate places. [2023-08-30 13:48:03,142 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 95 flow [2023-08-30 13:48:03,142 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 13:48:03,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:03,143 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:03,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 13:48:03,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-30 13:48:03,349 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 13:48:03,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:03,349 INFO L85 PathProgramCache]: Analyzing trace with hash -512084965, now seen corresponding path program 2 times [2023-08-30 13:48:03,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:03,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173396947] [2023-08-30 13:48:03,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:03,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:03,476 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 13:48:03,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:03,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173396947] [2023-08-30 13:48:03,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173396947] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:48:03,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402542015] [2023-08-30 13:48:03,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 13:48:03,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:48:03,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:48:03,488 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 13:48:03,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 13:48:03,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 13:48:03,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 13:48:03,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 13:48:03,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:48:03,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 13:48:03,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:48:03,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 13:48:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 13:48:03,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 13:48:03,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402542015] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:03,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 13:48:03,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2023-08-30 13:48:03,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103471664] [2023-08-30 13:48:03,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:03,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 13:48:03,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:03,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 13:48:03,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-30 13:48:03,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 179 [2023-08-30 13:48:03,759 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 13:48:03,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:03,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 179 [2023-08-30 13:48:03,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:03,850 INFO L130 PetriNetUnfolder]: 136/276 cut-off events. [2023-08-30 13:48:03,850 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 13:48:03,851 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 13:48:03,852 INFO L137 encePairwiseOnDemand]: 173/179 looper letters, 42 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2023-08-30 13:48:03,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 227 flow [2023-08-30 13:48:03,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 13:48:03,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 13:48:03,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 369 transitions. [2023-08-30 13:48:03,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153631284916201 [2023-08-30 13:48:03,854 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 369 transitions. [2023-08-30 13:48:03,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 369 transitions. [2023-08-30 13:48:03,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:03,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 369 transitions. [2023-08-30 13:48:03,855 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 13:48:03,856 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 13:48:03,857 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 13:48:03,857 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 95 flow. Second operand 4 states and 369 transitions. [2023-08-30 13:48:03,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 227 flow [2023-08-30 13:48:03,858 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 13:48:03,859 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 115 flow [2023-08-30 13:48:03,859 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 13:48:03,859 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2023-08-30 13:48:03,859 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 115 flow [2023-08-30 13:48:03,860 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 13:48:03,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:03,860 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:03,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-30 13:48:04,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:48:04,066 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 13:48:04,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:04,066 INFO L85 PathProgramCache]: Analyzing trace with hash -512070322, now seen corresponding path program 1 times [2023-08-30 13:48:04,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:04,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876606676] [2023-08-30 13:48:04,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:04,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:04,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 13:48:04,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:04,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876606676] [2023-08-30 13:48:04,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876606676] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:48:04,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027886235] [2023-08-30 13:48:04,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:04,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:48:04,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:48:04,175 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 13:48:04,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-30 13:48:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:04,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 13:48:04,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:48:04,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 13:48:04,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:48:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 13:48:04,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027886235] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:48:04,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:48:04,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-30 13:48:04,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732128565] [2023-08-30 13:48:04,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:48:04,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 13:48:04,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:04,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 13:48:04,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-30 13:48:04,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 179 [2023-08-30 13:48:04,346 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 13:48:04,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:04,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 179 [2023-08-30 13:48:04,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:04,435 INFO L130 PetriNetUnfolder]: 136/282 cut-off events. [2023-08-30 13:48:04,435 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2023-08-30 13:48:04,437 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 13:48:04,438 INFO L137 encePairwiseOnDemand]: 176/179 looper letters, 27 selfloop transitions, 11 changer transitions 0/38 dead transitions. [2023-08-30 13:48:04,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 227 flow [2023-08-30 13:48:04,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 13:48:04,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 13:48:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1036 transitions. [2023-08-30 13:48:04,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4823091247672253 [2023-08-30 13:48:04,441 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1036 transitions. [2023-08-30 13:48:04,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1036 transitions. [2023-08-30 13:48:04,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:04,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1036 transitions. [2023-08-30 13:48:04,445 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 13:48:04,449 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 13:48:04,450 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 13:48:04,450 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 115 flow. Second operand 12 states and 1036 transitions. [2023-08-30 13:48:04,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 227 flow [2023-08-30 13:48:04,453 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 13:48:04,454 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 199 flow [2023-08-30 13:48:04,454 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 13:48:04,456 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 29 predicate places. [2023-08-30 13:48:04,457 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 199 flow [2023-08-30 13:48:04,457 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 13:48:04,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:04,459 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:04,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-30 13:48:04,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:48:04,665 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 13:48:04,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:04,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1904182542, now seen corresponding path program 2 times [2023-08-30 13:48:04,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:04,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395209821] [2023-08-30 13:48:04,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:04,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:04,892 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:48:04,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:04,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395209821] [2023-08-30 13:48:04,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395209821] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:04,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:04,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 13:48:04,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372210609] [2023-08-30 13:48:04,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:04,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 13:48:04,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:04,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 13:48:04,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 13:48:04,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 179 [2023-08-30 13:48:04,921 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 13:48:04,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:04,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 179 [2023-08-30 13:48:04,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:05,001 INFO L130 PetriNetUnfolder]: 126/262 cut-off events. [2023-08-30 13:48:05,001 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2023-08-30 13:48:05,002 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 13:48:05,003 INFO L137 encePairwiseOnDemand]: 173/179 looper letters, 44 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2023-08-30 13:48:05,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 330 flow [2023-08-30 13:48:05,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 13:48:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 13:48:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 365 transitions. [2023-08-30 13:48:05,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5097765363128491 [2023-08-30 13:48:05,005 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 365 transitions. [2023-08-30 13:48:05,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 365 transitions. [2023-08-30 13:48:05,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:05,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 365 transitions. [2023-08-30 13:48:05,006 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 13:48:05,007 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 13:48:05,007 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 13:48:05,007 INFO L175 Difference]: Start difference. First operand has 56 places, 38 transitions, 199 flow. Second operand 4 states and 365 transitions. [2023-08-30 13:48:05,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 330 flow [2023-08-30 13:48:05,010 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 13:48:05,011 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 183 flow [2023-08-30 13:48:05,011 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 13:48:05,012 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 29 predicate places. [2023-08-30 13:48:05,012 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 183 flow [2023-08-30 13:48:05,012 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 13:48:05,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:05,012 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:05,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 13:48:05,012 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 13:48:05,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:05,013 INFO L85 PathProgramCache]: Analyzing trace with hash 249274821, now seen corresponding path program 1 times [2023-08-30 13:48:05,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:05,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796374485] [2023-08-30 13:48:05,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:05,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:48:05,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:05,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796374485] [2023-08-30 13:48:05,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796374485] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:05,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:05,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 13:48:05,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975340626] [2023-08-30 13:48:05,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:05,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 13:48:05,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:05,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 13:48:05,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 13:48:05,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 179 [2023-08-30 13:48:05,096 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 13:48:05,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:05,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 179 [2023-08-30 13:48:05,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:05,167 INFO L130 PetriNetUnfolder]: 176/362 cut-off events. [2023-08-30 13:48:05,167 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2023-08-30 13:48:05,168 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 13:48:05,170 INFO L137 encePairwiseOnDemand]: 174/179 looper letters, 56 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-30 13:48:05,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 58 transitions, 361 flow [2023-08-30 13:48:05,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 13:48:05,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 13:48:05,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2023-08-30 13:48:05,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5437616387337058 [2023-08-30 13:48:05,171 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 292 transitions. [2023-08-30 13:48:05,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 292 transitions. [2023-08-30 13:48:05,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:05,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 292 transitions. [2023-08-30 13:48:05,173 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 13:48:05,174 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 13:48:05,174 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 13:48:05,174 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 183 flow. Second operand 3 states and 292 transitions. [2023-08-30 13:48:05,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 58 transitions, 361 flow [2023-08-30 13:48:05,176 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 13:48:05,177 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 194 flow [2023-08-30 13:48:05,177 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 13:48:05,177 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 31 predicate places. [2023-08-30 13:48:05,178 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 194 flow [2023-08-30 13:48:05,178 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 13:48:05,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:05,178 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:05,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 13:48:05,178 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 13:48:05,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:05,179 INFO L85 PathProgramCache]: Analyzing trace with hash 263361348, now seen corresponding path program 1 times [2023-08-30 13:48:05,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:05,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626520093] [2023-08-30 13:48:05,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:05,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:48:05,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:05,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626520093] [2023-08-30 13:48:05,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626520093] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:05,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:05,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 13:48:05,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080666051] [2023-08-30 13:48:05,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:05,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 13:48:05,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:05,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 13:48:05,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 13:48:05,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 179 [2023-08-30 13:48:05,264 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 13:48:05,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:05,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 179 [2023-08-30 13:48:05,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:05,364 INFO L130 PetriNetUnfolder]: 238/486 cut-off events. [2023-08-30 13:48:05,365 INFO L131 PetriNetUnfolder]: For 243/243 co-relation queries the response was YES. [2023-08-30 13:48:05,366 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 13:48:05,368 INFO L137 encePairwiseOnDemand]: 174/179 looper letters, 58 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-30 13:48:05,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 60 transitions, 391 flow [2023-08-30 13:48:05,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 13:48:05,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 13:48:05,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2023-08-30 13:48:05,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5493482309124768 [2023-08-30 13:48:05,370 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 295 transitions. [2023-08-30 13:48:05,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 295 transitions. [2023-08-30 13:48:05,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:05,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 295 transitions. [2023-08-30 13:48:05,371 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 13:48:05,372 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 13:48:05,372 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 13:48:05,372 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 194 flow. Second operand 3 states and 295 transitions. [2023-08-30 13:48:05,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 60 transitions, 391 flow [2023-08-30 13:48:05,374 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 13:48:05,375 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 208 flow [2023-08-30 13:48:05,375 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 13:48:05,376 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 33 predicate places. [2023-08-30 13:48:05,376 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 208 flow [2023-08-30 13:48:05,376 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 13:48:05,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:05,376 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:05,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 13:48:05,377 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 13:48:05,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:05,377 INFO L85 PathProgramCache]: Analyzing trace with hash -964451862, now seen corresponding path program 1 times [2023-08-30 13:48:05,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:05,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245618955] [2023-08-30 13:48:05,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:05,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:05,641 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:48:05,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:05,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245618955] [2023-08-30 13:48:05,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245618955] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:05,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:05,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 13:48:05,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89397941] [2023-08-30 13:48:05,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:05,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 13:48:05,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:05,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 13:48:05,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 13:48:05,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 179 [2023-08-30 13:48:05,756 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 13:48:05,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:05,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 179 [2023-08-30 13:48:05,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:06,051 INFO L130 PetriNetUnfolder]: 264/550 cut-off events. [2023-08-30 13:48:06,051 INFO L131 PetriNetUnfolder]: For 299/299 co-relation queries the response was YES. [2023-08-30 13:48:06,053 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 13:48:06,055 INFO L137 encePairwiseOnDemand]: 170/179 looper letters, 57 selfloop transitions, 20 changer transitions 0/77 dead transitions. [2023-08-30 13:48:06,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 77 transitions, 502 flow [2023-08-30 13:48:06,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 13:48:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 13:48:06,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 880 transitions. [2023-08-30 13:48:06,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44692737430167595 [2023-08-30 13:48:06,058 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 880 transitions. [2023-08-30 13:48:06,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 880 transitions. [2023-08-30 13:48:06,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:06,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 880 transitions. [2023-08-30 13:48:06,062 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 13:48:06,065 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 13:48:06,066 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 13:48:06,066 INFO L175 Difference]: Start difference. First operand has 60 places, 42 transitions, 208 flow. Second operand 11 states and 880 transitions. [2023-08-30 13:48:06,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 77 transitions, 502 flow [2023-08-30 13:48:06,068 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 13:48:06,070 INFO L231 Difference]: Finished difference. Result has 74 places, 55 transitions, 350 flow [2023-08-30 13:48:06,070 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 13:48:06,071 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 47 predicate places. [2023-08-30 13:48:06,071 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 55 transitions, 350 flow [2023-08-30 13:48:06,071 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 13:48:06,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:06,072 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:06,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 13:48:06,072 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 13:48:06,072 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:06,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1213833421, now seen corresponding path program 1 times [2023-08-30 13:48:06,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:06,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032666582] [2023-08-30 13:48:06,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:06,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:48:06,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:06,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032666582] [2023-08-30 13:48:06,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032666582] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:06,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:06,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 13:48:06,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861838128] [2023-08-30 13:48:06,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:06,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 13:48:06,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:06,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 13:48:06,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-30 13:48:06,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 179 [2023-08-30 13:48:06,484 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 13:48:06,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:06,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 179 [2023-08-30 13:48:06,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:06,814 INFO L130 PetriNetUnfolder]: 285/618 cut-off events. [2023-08-30 13:48:06,815 INFO L131 PetriNetUnfolder]: For 874/874 co-relation queries the response was YES. [2023-08-30 13:48:06,816 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 13:48:06,819 INFO L137 encePairwiseOnDemand]: 171/179 looper letters, 69 selfloop transitions, 24 changer transitions 0/93 dead transitions. [2023-08-30 13:48:06,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 93 transitions, 706 flow [2023-08-30 13:48:06,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 13:48:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 13:48:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 899 transitions. [2023-08-30 13:48:06,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45657694261046217 [2023-08-30 13:48:06,823 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 899 transitions. [2023-08-30 13:48:06,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 899 transitions. [2023-08-30 13:48:06,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:06,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 899 transitions. [2023-08-30 13:48:06,826 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 13:48:06,828 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 13:48:06,829 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 13:48:06,829 INFO L175 Difference]: Start difference. First operand has 74 places, 55 transitions, 350 flow. Second operand 11 states and 899 transitions. [2023-08-30 13:48:06,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 93 transitions, 706 flow [2023-08-30 13:48:06,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 13:48:06,834 INFO L231 Difference]: Finished difference. Result has 81 places, 61 transitions, 419 flow [2023-08-30 13:48:06,835 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 13:48:06,835 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 54 predicate places. [2023-08-30 13:48:06,835 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 61 transitions, 419 flow [2023-08-30 13:48:06,836 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 13:48:06,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:06,836 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:06,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 13:48:06,836 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 13:48:06,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:06,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1212049482, now seen corresponding path program 2 times [2023-08-30 13:48:06,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:06,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554943719] [2023-08-30 13:48:06,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:06,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:48:07,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:07,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554943719] [2023-08-30 13:48:07,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554943719] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:07,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:07,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 13:48:07,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225206540] [2023-08-30 13:48:07,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:07,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 13:48:07,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:07,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 13:48:07,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-30 13:48:07,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 179 [2023-08-30 13:48:07,201 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 13:48:07,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:07,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 179 [2023-08-30 13:48:07,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:07,502 INFO L130 PetriNetUnfolder]: 278/604 cut-off events. [2023-08-30 13:48:07,502 INFO L131 PetriNetUnfolder]: For 1154/1154 co-relation queries the response was YES. [2023-08-30 13:48:07,504 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 13:48:07,507 INFO L137 encePairwiseOnDemand]: 171/179 looper letters, 68 selfloop transitions, 24 changer transitions 0/92 dead transitions. [2023-08-30 13:48:07,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 92 transitions, 725 flow [2023-08-30 13:48:07,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 13:48:07,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 13:48:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 887 transitions. [2023-08-30 13:48:07,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4504824784154393 [2023-08-30 13:48:07,510 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 887 transitions. [2023-08-30 13:48:07,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 887 transitions. [2023-08-30 13:48:07,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:07,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 887 transitions. [2023-08-30 13:48:07,512 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 13:48:07,514 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 13:48:07,515 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 13:48:07,515 INFO L175 Difference]: Start difference. First operand has 81 places, 61 transitions, 419 flow. Second operand 11 states and 887 transitions. [2023-08-30 13:48:07,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 92 transitions, 725 flow [2023-08-30 13:48:07,519 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 13:48:07,521 INFO L231 Difference]: Finished difference. Result has 84 places, 60 transitions, 416 flow [2023-08-30 13:48:07,521 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 13:48:07,521 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 57 predicate places. [2023-08-30 13:48:07,522 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 60 transitions, 416 flow [2023-08-30 13:48:07,522 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 13:48:07,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:07,522 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:07,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 13:48:07,522 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 13:48:07,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:07,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1211471901, now seen corresponding path program 1 times [2023-08-30 13:48:07,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:07,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793097638] [2023-08-30 13:48:07,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:07,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:48:07,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:07,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793097638] [2023-08-30 13:48:07,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793097638] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:07,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:07,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 13:48:07,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575652718] [2023-08-30 13:48:07,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:07,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 13:48:07,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:07,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 13:48:07,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 13:48:07,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 179 [2023-08-30 13:48:07,947 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 13:48:07,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:07,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 179 [2023-08-30 13:48:07,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:08,171 INFO L130 PetriNetUnfolder]: 303/667 cut-off events. [2023-08-30 13:48:08,171 INFO L131 PetriNetUnfolder]: For 1320/1320 co-relation queries the response was YES. [2023-08-30 13:48:08,173 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 13:48:08,176 INFO L137 encePairwiseOnDemand]: 170/179 looper letters, 69 selfloop transitions, 27 changer transitions 0/96 dead transitions. [2023-08-30 13:48:08,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 96 transitions, 835 flow [2023-08-30 13:48:08,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 13:48:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 13:48:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 661 transitions. [2023-08-30 13:48:08,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4615921787709497 [2023-08-30 13:48:08,178 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 661 transitions. [2023-08-30 13:48:08,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 661 transitions. [2023-08-30 13:48:08,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:08,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 661 transitions. [2023-08-30 13:48:08,180 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 13:48:08,182 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 13:48:08,182 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 13:48:08,182 INFO L175 Difference]: Start difference. First operand has 84 places, 60 transitions, 416 flow. Second operand 8 states and 661 transitions. [2023-08-30 13:48:08,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 96 transitions, 835 flow [2023-08-30 13:48:08,186 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 13:48:08,190 INFO L231 Difference]: Finished difference. Result has 87 places, 75 transitions, 601 flow [2023-08-30 13:48:08,190 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 13:48:08,190 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 60 predicate places. [2023-08-30 13:48:08,191 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 75 transitions, 601 flow [2023-08-30 13:48:08,191 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 13:48:08,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:08,191 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:08,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 13:48:08,191 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 13:48:08,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:08,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1211471918, now seen corresponding path program 1 times [2023-08-30 13:48:08,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:08,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660594768] [2023-08-30 13:48:08,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:08,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:08,474 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:48:08,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:08,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660594768] [2023-08-30 13:48:08,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660594768] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:08,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:08,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 13:48:08,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452852342] [2023-08-30 13:48:08,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:08,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 13:48:08,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:08,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 13:48:08,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 13:48:08,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 179 [2023-08-30 13:48:08,577 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 13:48:08,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:08,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 179 [2023-08-30 13:48:08,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:08,829 INFO L130 PetriNetUnfolder]: 296/678 cut-off events. [2023-08-30 13:48:08,829 INFO L131 PetriNetUnfolder]: For 1928/1928 co-relation queries the response was YES. [2023-08-30 13:48:08,831 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 13:48:08,835 INFO L137 encePairwiseOnDemand]: 170/179 looper letters, 72 selfloop transitions, 30 changer transitions 0/102 dead transitions. [2023-08-30 13:48:08,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 102 transitions, 971 flow [2023-08-30 13:48:08,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 13:48:08,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 13:48:08,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 730 transitions. [2023-08-30 13:48:08,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45313469894475483 [2023-08-30 13:48:08,837 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 730 transitions. [2023-08-30 13:48:08,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 730 transitions. [2023-08-30 13:48:08,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:08,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 730 transitions. [2023-08-30 13:48:08,840 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 13:48:08,842 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 13:48:08,842 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 13:48:08,842 INFO L175 Difference]: Start difference. First operand has 87 places, 75 transitions, 601 flow. Second operand 9 states and 730 transitions. [2023-08-30 13:48:08,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 102 transitions, 971 flow [2023-08-30 13:48:08,849 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 13:48:08,850 INFO L231 Difference]: Finished difference. Result has 95 places, 80 transitions, 696 flow [2023-08-30 13:48:08,851 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 13:48:08,852 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 68 predicate places. [2023-08-30 13:48:08,852 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 80 transitions, 696 flow [2023-08-30 13:48:08,852 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 13:48:08,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:08,853 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:08,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 13:48:08,853 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 13:48:08,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:08,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1204754528, now seen corresponding path program 2 times [2023-08-30 13:48:08,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:08,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884696463] [2023-08-30 13:48:08,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:08,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:09,103 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:48:09,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:09,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884696463] [2023-08-30 13:48:09,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884696463] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:09,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:09,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 13:48:09,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935229911] [2023-08-30 13:48:09,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:09,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 13:48:09,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:09,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 13:48:09,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 13:48:09,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 179 [2023-08-30 13:48:09,231 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 13:48:09,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:09,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 179 [2023-08-30 13:48:09,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:09,548 INFO L130 PetriNetUnfolder]: 322/723 cut-off events. [2023-08-30 13:48:09,549 INFO L131 PetriNetUnfolder]: For 2624/2624 co-relation queries the response was YES. [2023-08-30 13:48:09,552 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 13:48:09,556 INFO L137 encePairwiseOnDemand]: 170/179 looper letters, 73 selfloop transitions, 42 changer transitions 0/115 dead transitions. [2023-08-30 13:48:09,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 115 transitions, 1179 flow [2023-08-30 13:48:09,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 13:48:09,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 13:48:09,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 880 transitions. [2023-08-30 13:48:09,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44692737430167595 [2023-08-30 13:48:09,560 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 880 transitions. [2023-08-30 13:48:09,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 880 transitions. [2023-08-30 13:48:09,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:09,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 880 transitions. [2023-08-30 13:48:09,563 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 13:48:09,565 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 13:48:09,565 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 13:48:09,565 INFO L175 Difference]: Start difference. First operand has 95 places, 80 transitions, 696 flow. Second operand 11 states and 880 transitions. [2023-08-30 13:48:09,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 115 transitions, 1179 flow [2023-08-30 13:48:09,573 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 13:48:09,576 INFO L231 Difference]: Finished difference. Result has 105 places, 94 transitions, 953 flow [2023-08-30 13:48:09,576 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 13:48:09,576 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 78 predicate places. [2023-08-30 13:48:09,576 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 94 transitions, 953 flow [2023-08-30 13:48:09,577 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 13:48:09,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:09,577 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:09,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 13:48:09,577 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 13:48:09,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:09,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1204322061, now seen corresponding path program 2 times [2023-08-30 13:48:09,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:09,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334169622] [2023-08-30 13:48:09,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:09,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:48:09,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:09,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334169622] [2023-08-30 13:48:09,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334169622] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:09,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:09,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 13:48:09,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119212971] [2023-08-30 13:48:09,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:09,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 13:48:09,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:09,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 13:48:09,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-30 13:48:09,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 179 [2023-08-30 13:48:09,940 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 13:48:09,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:09,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 179 [2023-08-30 13:48:09,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:10,266 INFO L130 PetriNetUnfolder]: 333/746 cut-off events. [2023-08-30 13:48:10,267 INFO L131 PetriNetUnfolder]: For 4266/4266 co-relation queries the response was YES. [2023-08-30 13:48:10,270 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 13:48:10,275 INFO L137 encePairwiseOnDemand]: 170/179 looper letters, 85 selfloop transitions, 34 changer transitions 0/119 dead transitions. [2023-08-30 13:48:10,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 119 transitions, 1377 flow [2023-08-30 13:48:10,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 13:48:10,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 13:48:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 814 transitions. [2023-08-30 13:48:10,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4547486033519553 [2023-08-30 13:48:10,278 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 814 transitions. [2023-08-30 13:48:10,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 814 transitions. [2023-08-30 13:48:10,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:10,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 814 transitions. [2023-08-30 13:48:10,281 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 13:48:10,283 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 13:48:10,283 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 13:48:10,284 INFO L175 Difference]: Start difference. First operand has 105 places, 94 transitions, 953 flow. Second operand 10 states and 814 transitions. [2023-08-30 13:48:10,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 119 transitions, 1377 flow [2023-08-30 13:48:10,297 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 13:48:10,299 INFO L231 Difference]: Finished difference. Result has 113 places, 100 transitions, 1106 flow [2023-08-30 13:48:10,299 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 13:48:10,300 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 86 predicate places. [2023-08-30 13:48:10,300 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 100 transitions, 1106 flow [2023-08-30 13:48:10,301 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 13:48:10,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:10,301 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:10,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 13:48:10,301 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 13:48:10,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:10,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1204804731, now seen corresponding path program 3 times [2023-08-30 13:48:10,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:10,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446010415] [2023-08-30 13:48:10,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:10,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:10,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 13:48:10,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:10,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446010415] [2023-08-30 13:48:10,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446010415] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:10,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:10,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 13:48:10,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468568855] [2023-08-30 13:48:10,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:10,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 13:48:10,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:10,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 13:48:10,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-30 13:48:10,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 179 [2023-08-30 13:48:10,656 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 13:48:10,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:10,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 179 [2023-08-30 13:48:10,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:11,023 INFO L130 PetriNetUnfolder]: 355/796 cut-off events. [2023-08-30 13:48:11,023 INFO L131 PetriNetUnfolder]: For 5418/5418 co-relation queries the response was YES. [2023-08-30 13:48:11,027 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 13:48:11,031 INFO L137 encePairwiseOnDemand]: 171/179 looper letters, 85 selfloop transitions, 53 changer transitions 0/138 dead transitions. [2023-08-30 13:48:11,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 138 transitions, 1666 flow [2023-08-30 13:48:11,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 13:48:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 13:48:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 899 transitions. [2023-08-30 13:48:11,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45657694261046217 [2023-08-30 13:48:11,033 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 899 transitions. [2023-08-30 13:48:11,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 899 transitions. [2023-08-30 13:48:11,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:11,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 899 transitions. [2023-08-30 13:48:11,036 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 13:48:11,039 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 13:48:11,040 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 13:48:11,040 INFO L175 Difference]: Start difference. First operand has 113 places, 100 transitions, 1106 flow. Second operand 11 states and 899 transitions. [2023-08-30 13:48:11,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 138 transitions, 1666 flow [2023-08-30 13:48:11,065 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 13:48:11,069 INFO L231 Difference]: Finished difference. Result has 117 places, 107 transitions, 1227 flow [2023-08-30 13:48:11,069 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 13:48:11,070 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 90 predicate places. [2023-08-30 13:48:11,070 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 107 transitions, 1227 flow [2023-08-30 13:48:11,070 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 13:48:11,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:11,071 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:11,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 13:48:11,071 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 13:48:11,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:11,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1204804748, now seen corresponding path program 3 times [2023-08-30 13:48:11,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:11,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140844019] [2023-08-30 13:48:11,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:11,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:48:11,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:11,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140844019] [2023-08-30 13:48:11,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140844019] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:48:11,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:48:11,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 13:48:11,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592110009] [2023-08-30 13:48:11,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:48:11,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 13:48:11,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:11,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 13:48:11,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-30 13:48:11,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 179 [2023-08-30 13:48:11,389 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 13:48:11,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:11,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 179 [2023-08-30 13:48:11,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:11,699 INFO L130 PetriNetUnfolder]: 348/782 cut-off events. [2023-08-30 13:48:11,699 INFO L131 PetriNetUnfolder]: For 5635/5635 co-relation queries the response was YES. [2023-08-30 13:48:11,703 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 13:48:11,707 INFO L137 encePairwiseOnDemand]: 171/179 looper letters, 84 selfloop transitions, 52 changer transitions 0/136 dead transitions. [2023-08-30 13:48:11,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 136 transitions, 1671 flow [2023-08-30 13:48:11,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 13:48:11,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 13:48:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 887 transitions. [2023-08-30 13:48:11,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4504824784154393 [2023-08-30 13:48:11,710 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 887 transitions. [2023-08-30 13:48:11,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 887 transitions. [2023-08-30 13:48:11,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:11,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 887 transitions. [2023-08-30 13:48:11,712 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 13:48:11,714 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 13:48:11,714 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 13:48:11,715 INFO L175 Difference]: Start difference. First operand has 117 places, 107 transitions, 1227 flow. Second operand 11 states and 887 transitions. [2023-08-30 13:48:11,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 136 transitions, 1671 flow [2023-08-30 13:48:11,729 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 13:48:11,731 INFO L231 Difference]: Finished difference. Result has 120 places, 105 transitions, 1216 flow [2023-08-30 13:48:11,731 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 13:48:11,732 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 93 predicate places. [2023-08-30 13:48:11,732 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 105 transitions, 1216 flow [2023-08-30 13:48:11,732 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 13:48:11,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:11,733 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:11,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 13:48:11,733 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 13:48:11,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:11,733 INFO L85 PathProgramCache]: Analyzing trace with hash -965041958, now seen corresponding path program 1 times [2023-08-30 13:48:11,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:11,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575114924] [2023-08-30 13:48:11,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:11,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:11,942 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:48:11,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:11,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575114924] [2023-08-30 13:48:11,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575114924] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:48:11,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730577091] [2023-08-30 13:48:11,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:11,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:48:11,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:48:11,945 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 13:48:11,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-30 13:48:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:12,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-30 13:48:12,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:48:12,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 13:48:12,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:48:12,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 13:48:12,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-30 13:48:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:48:16,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:48:22,445 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 13:48:22,594 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:48:22,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730577091] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:48:22,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:48:22,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2023-08-30 13:48:22,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474415529] [2023-08-30 13:48:22,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:48:22,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-30 13:48:22,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:22,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-30 13:48:22,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=215, Unknown=8, NotChecked=32, Total=342 [2023-08-30 13:48:22,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 179 [2023-08-30 13:48:22,672 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 13:48:22,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:48:22,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 179 [2023-08-30 13:48:22,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:48:23,687 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 13:48:24,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:48:26,064 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 13:48:27,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:48:29,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:48:30,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:48:31,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:48:33,594 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 13:48:34,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:48:35,951 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 13:48:37,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:48:38,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:48:39,513 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 13:48:43,650 INFO L130 PetriNetUnfolder]: 330/743 cut-off events. [2023-08-30 13:48:43,650 INFO L131 PetriNetUnfolder]: For 5463/5463 co-relation queries the response was YES. [2023-08-30 13:48:43,653 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 13:48:43,658 INFO L137 encePairwiseOnDemand]: 172/179 looper letters, 113 selfloop transitions, 44 changer transitions 0/157 dead transitions. [2023-08-30 13:48:43,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 157 transitions, 1903 flow [2023-08-30 13:48:43,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 13:48:43,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 13:48:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 805 transitions. [2023-08-30 13:48:43,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40883697308278316 [2023-08-30 13:48:43,660 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 805 transitions. [2023-08-30 13:48:43,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 805 transitions. [2023-08-30 13:48:43,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:48:43,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 805 transitions. [2023-08-30 13:48:43,662 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 13:48:43,676 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 13:48:43,677 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 13:48:43,677 INFO L175 Difference]: Start difference. First operand has 120 places, 105 transitions, 1216 flow. Second operand 11 states and 805 transitions. [2023-08-30 13:48:43,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 157 transitions, 1903 flow [2023-08-30 13:48:43,690 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 13:48:43,694 INFO L231 Difference]: Finished difference. Result has 127 places, 117 transitions, 1400 flow [2023-08-30 13:48:43,694 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 13:48:43,695 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 100 predicate places. [2023-08-30 13:48:43,695 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 117 transitions, 1400 flow [2023-08-30 13:48:43,695 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 13:48:43,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:48:43,696 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:48:43,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 13:48:43,903 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 13:48:43,904 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 13:48:43,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:48:43,904 INFO L85 PathProgramCache]: Analyzing trace with hash -312793093, now seen corresponding path program 1 times [2023-08-30 13:48:43,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:48:43,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932534142] [2023-08-30 13:48:43,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:43,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:48:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:44,146 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:48:44,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:48:44,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932534142] [2023-08-30 13:48:44,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932534142] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:48:44,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933953284] [2023-08-30 13:48:44,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:48:44,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:48:44,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:48:44,149 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 13:48:44,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-30 13:48:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:48:44,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-30 13:48:44,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:48:44,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 13:48:44,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:48:44,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 13:48:44,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-30 13:48:48,722 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:48:48,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:48:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:48:53,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933953284] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:48:53,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:48:53,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2023-08-30 13:48:53,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820196399] [2023-08-30 13:48:53,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:48:53,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 13:48:53,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:48:53,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 13:48:53,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=266, Unknown=12, NotChecked=0, Total=380 [2023-08-30 13:48:54,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:48:55,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:48:56,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:48:57,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:48:58,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:48:59,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:00,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:01,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:03,042 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 13:49:04,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:05,289 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 13:49:06,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:07,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:08,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:09,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:09,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 179 [2023-08-30 13:49:09,738 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 13:49:09,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:49:09,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 179 [2023-08-30 13:49:09,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:49:11,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:12,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:13,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:15,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:17,138 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 13:49:18,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:19,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:23,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:25,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:29,940 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 13:49:31,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:32,184 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 13:49:35,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:38,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:39,301 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 13:49:41,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:49:42,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:49:47,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:48,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:49,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:49:50,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:49:52,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:49:58,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 13:50:00,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:50:01,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:50:03,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:50:04,457 INFO L130 PetriNetUnfolder]: 328/736 cut-off events. [2023-08-30 13:50:04,457 INFO L131 PetriNetUnfolder]: For 6549/6549 co-relation queries the response was YES. [2023-08-30 13:50:04,460 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 3759 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 13:50:04,465 INFO L137 encePairwiseOnDemand]: 171/179 looper letters, 127 selfloop transitions, 78 changer transitions 0/205 dead transitions. [2023-08-30 13:50:04,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 205 transitions, 2702 flow [2023-08-30 13:50:04,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 13:50:04,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 13:50:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 950 transitions. [2023-08-30 13:50:04,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790901835594573 [2023-08-30 13:50:04,468 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 950 transitions. [2023-08-30 13:50:04,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 950 transitions. [2023-08-30 13:50:04,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:50:04,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 950 transitions. [2023-08-30 13:50:04,470 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 13:50:04,472 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 13:50:04,472 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 13:50:04,473 INFO L175 Difference]: Start difference. First operand has 127 places, 117 transitions, 1400 flow. Second operand 14 states and 950 transitions. [2023-08-30 13:50:04,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 205 transitions, 2702 flow [2023-08-30 13:50:04,493 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 13:50:04,496 INFO L231 Difference]: Finished difference. Result has 143 places, 141 transitions, 1879 flow [2023-08-30 13:50:04,496 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 13:50:04,497 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 116 predicate places. [2023-08-30 13:50:04,497 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 141 transitions, 1879 flow [2023-08-30 13:50:04,497 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 13:50:04,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:50:04,497 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 13:50:04,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-30 13:50:04,705 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 13:50:04,705 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 13:50:04,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:50:04,705 INFO L85 PathProgramCache]: Analyzing trace with hash 307606274, now seen corresponding path program 1 times [2023-08-30 13:50:04,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:50:04,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908524699] [2023-08-30 13:50:04,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:50:04,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:50:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:50:04,762 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 13:50:04,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:50:04,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908524699] [2023-08-30 13:50:04,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908524699] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:50:04,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89150375] [2023-08-30 13:50:04,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:50:04,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:50:04,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:50:04,764 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 13:50:04,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-30 13:50:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:50:04,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 13:50:04,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:50:04,884 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:50:04,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 13:50:04,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89150375] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:50:04,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 13:50:04,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-08-30 13:50:04,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588233450] [2023-08-30 13:50:04,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:50:04,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 13:50:04,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:50:04,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 13:50:04,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 13:50:04,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 179 [2023-08-30 13:50:04,897 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 13:50:04,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:50:04,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 179 [2023-08-30 13:50:04,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:50:05,070 INFO L130 PetriNetUnfolder]: 310/696 cut-off events. [2023-08-30 13:50:05,070 INFO L131 PetriNetUnfolder]: For 6812/6812 co-relation queries the response was YES. [2023-08-30 13:50:05,074 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 3495 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 13:50:05,083 INFO L137 encePairwiseOnDemand]: 176/179 looper letters, 168 selfloop transitions, 4 changer transitions 0/172 dead transitions. [2023-08-30 13:50:05,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 172 transitions, 2534 flow [2023-08-30 13:50:05,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 13:50:05,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 13:50:05,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 381 transitions. [2023-08-30 13:50:05,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321229050279329 [2023-08-30 13:50:05,084 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 381 transitions. [2023-08-30 13:50:05,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 381 transitions. [2023-08-30 13:50:05,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:50:05,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 381 transitions. [2023-08-30 13:50:05,086 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 13:50:05,086 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 13:50:05,087 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 13:50:05,087 INFO L175 Difference]: Start difference. First operand has 143 places, 141 transitions, 1879 flow. Second operand 4 states and 381 transitions. [2023-08-30 13:50:05,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 172 transitions, 2534 flow [2023-08-30 13:50:05,114 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 13:50:05,117 INFO L231 Difference]: Finished difference. Result has 140 places, 140 transitions, 1796 flow [2023-08-30 13:50:05,117 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 13:50:05,118 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 113 predicate places. [2023-08-30 13:50:05,118 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 140 transitions, 1796 flow [2023-08-30 13:50:05,118 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 13:50:05,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:50:05,118 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 13:50:05,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-30 13:50:05,324 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 13:50:05,324 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 13:50:05,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:50:05,324 INFO L85 PathProgramCache]: Analyzing trace with hash 307606276, now seen corresponding path program 1 times [2023-08-30 13:50:05,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:50:05,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035446090] [2023-08-30 13:50:05,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:50:05,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:50:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:50:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 13:50:05,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:50:05,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035446090] [2023-08-30 13:50:05,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035446090] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:50:05,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:50:05,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 13:50:05,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384040026] [2023-08-30 13:50:05,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:50:05,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 13:50:05,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:50:05,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 13:50:05,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 13:50:05,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 179 [2023-08-30 13:50:05,371 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 13:50:05,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:50:05,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 179 [2023-08-30 13:50:05,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:50:05,497 INFO L130 PetriNetUnfolder]: 292/656 cut-off events. [2023-08-30 13:50:05,497 INFO L131 PetriNetUnfolder]: For 5925/5925 co-relation queries the response was YES. [2023-08-30 13:50:05,501 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 3223 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 13:50:05,504 INFO L137 encePairwiseOnDemand]: 175/179 looper letters, 155 selfloop transitions, 9 changer transitions 0/164 dead transitions. [2023-08-30 13:50:05,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 164 transitions, 2337 flow [2023-08-30 13:50:05,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 13:50:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 13:50:05,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2023-08-30 13:50:05,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.521415270018622 [2023-08-30 13:50:05,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2023-08-30 13:50:05,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2023-08-30 13:50:05,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:50:05,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2023-08-30 13:50:05,507 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 13:50:05,508 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 13:50:05,508 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 13:50:05,508 INFO L175 Difference]: Start difference. First operand has 140 places, 140 transitions, 1796 flow. Second operand 3 states and 280 transitions. [2023-08-30 13:50:05,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 164 transitions, 2337 flow [2023-08-30 13:50:05,531 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 13:50:05,534 INFO L231 Difference]: Finished difference. Result has 140 places, 140 transitions, 1820 flow [2023-08-30 13:50:05,534 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 13:50:05,534 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 113 predicate places. [2023-08-30 13:50:05,534 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 140 transitions, 1820 flow [2023-08-30 13:50:05,535 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 13:50:05,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:50:05,535 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 13:50:05,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 13:50:05,535 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 13:50:05,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:50:05,536 INFO L85 PathProgramCache]: Analyzing trace with hash 53554929, now seen corresponding path program 1 times [2023-08-30 13:50:05,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:50:05,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290506998] [2023-08-30 13:50:05,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:50:05,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:50:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:50:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:50:05,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:50:05,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290506998] [2023-08-30 13:50:05,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290506998] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:50:05,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:50:05,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 13:50:05,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737421916] [2023-08-30 13:50:05,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:50:05,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 13:50:05,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:50:05,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 13:50:05,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 13:50:05,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 179 [2023-08-30 13:50:05,585 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 13:50:05,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:50:05,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 179 [2023-08-30 13:50:05,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:50:05,700 INFO L130 PetriNetUnfolder]: 278/624 cut-off events. [2023-08-30 13:50:05,700 INFO L131 PetriNetUnfolder]: For 5811/5811 co-relation queries the response was YES. [2023-08-30 13:50:05,704 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 2974 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 13:50:05,707 INFO L137 encePairwiseOnDemand]: 177/179 looper letters, 151 selfloop transitions, 1 changer transitions 0/152 dead transitions. [2023-08-30 13:50:05,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 152 transitions, 2247 flow [2023-08-30 13:50:05,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 13:50:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 13:50:05,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2023-08-30 13:50:05,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5232774674115456 [2023-08-30 13:50:05,708 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 281 transitions. [2023-08-30 13:50:05,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 281 transitions. [2023-08-30 13:50:05,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:50:05,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 281 transitions. [2023-08-30 13:50:05,709 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 13:50:05,710 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 13:50:05,710 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 13:50:05,710 INFO L175 Difference]: Start difference. First operand has 140 places, 140 transitions, 1820 flow. Second operand 3 states and 281 transitions. [2023-08-30 13:50:05,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 152 transitions, 2247 flow [2023-08-30 13:50:05,735 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 13:50:05,738 INFO L231 Difference]: Finished difference. Result has 140 places, 139 transitions, 1809 flow [2023-08-30 13:50:05,738 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 13:50:05,738 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 113 predicate places. [2023-08-30 13:50:05,738 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 139 transitions, 1809 flow [2023-08-30 13:50:05,739 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 13:50:05,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:50:05,739 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 13:50:05,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 13:50:05,739 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 13:50:05,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:50:05,740 INFO L85 PathProgramCache]: Analyzing trace with hash 53554928, now seen corresponding path program 1 times [2023-08-30 13:50:05,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:50:05,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251720267] [2023-08-30 13:50:05,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:50:05,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:50:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:50:05,776 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 13:50:05,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:50:05,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251720267] [2023-08-30 13:50:05,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251720267] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 13:50:05,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 13:50:05,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 13:50:05,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943529271] [2023-08-30 13:50:05,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 13:50:05,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 13:50:05,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:50:05,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 13:50:05,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 13:50:05,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 179 [2023-08-30 13:50:05,786 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 13:50:05,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:50:05,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 179 [2023-08-30 13:50:05,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:50:05,899 INFO L130 PetriNetUnfolder]: 264/592 cut-off events. [2023-08-30 13:50:05,900 INFO L131 PetriNetUnfolder]: For 5385/5385 co-relation queries the response was YES. [2023-08-30 13:50:05,903 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 2788 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 13:50:05,907 INFO L137 encePairwiseOnDemand]: 175/179 looper letters, 148 selfloop transitions, 12 changer transitions 0/160 dead transitions. [2023-08-30 13:50:05,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 160 transitions, 2352 flow [2023-08-30 13:50:05,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 13:50:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 13:50:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2023-08-30 13:50:05,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5195530726256983 [2023-08-30 13:50:05,908 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 279 transitions. [2023-08-30 13:50:05,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 279 transitions. [2023-08-30 13:50:05,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:50:05,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 279 transitions. [2023-08-30 13:50:05,909 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 13:50:05,910 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 13:50:05,910 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 13:50:05,910 INFO L175 Difference]: Start difference. First operand has 140 places, 139 transitions, 1809 flow. Second operand 3 states and 279 transitions. [2023-08-30 13:50:05,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 160 transitions, 2352 flow [2023-08-30 13:50:05,933 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 13:50:05,936 INFO L231 Difference]: Finished difference. Result has 141 places, 139 transitions, 1846 flow [2023-08-30 13:50:05,936 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 13:50:05,937 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 114 predicate places. [2023-08-30 13:50:05,937 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 139 transitions, 1846 flow [2023-08-30 13:50:05,937 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 13:50:05,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:50:05,938 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:50:05,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-30 13:50:05,938 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 13:50:05,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:50:05,938 INFO L85 PathProgramCache]: Analyzing trace with hash -740167824, now seen corresponding path program 1 times [2023-08-30 13:50:05,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:50:05,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109179215] [2023-08-30 13:50:05,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:50:05,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:50:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:50:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:50:06,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:50:06,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109179215] [2023-08-30 13:50:06,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109179215] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:50:06,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650705491] [2023-08-30 13:50:06,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:50:06,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:50:06,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:50:06,314 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 13:50:06,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-30 13:50:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:50:06,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 13:50:06,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:50:06,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 13:50:06,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:50:06,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 13:50:06,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-30 13:50:06,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 13:50:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:50:06,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:50:09,338 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 13:50:09,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650705491] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:50:09,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:50:09,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-08-30 13:50:09,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245095160] [2023-08-30 13:50:09,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:50:09,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 13:50:09,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:50:09,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 13:50:09,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=777, Unknown=4, NotChecked=0, Total=930 [2023-08-30 13:50:11,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:50:12,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 179 [2023-08-30 13:50:12,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 139 transitions, 1846 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 13:50:12,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:50:12,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 179 [2023-08-30 13:50:12,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:50:14,813 INFO L130 PetriNetUnfolder]: 366/825 cut-off events. [2023-08-30 13:50:14,814 INFO L131 PetriNetUnfolder]: For 10240/10240 co-relation queries the response was YES. [2023-08-30 13:50:14,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5491 conditions, 825 events. 366/825 cut-off events. For 10240/10240 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4362 event pairs, 32 based on Foata normal form. 32/857 useless extension candidates. Maximal degree in co-relation 5425. Up to 393 conditions per place. [2023-08-30 13:50:14,820 INFO L137 encePairwiseOnDemand]: 166/179 looper letters, 156 selfloop transitions, 115 changer transitions 0/271 dead transitions. [2023-08-30 13:50:14,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 271 transitions, 3946 flow [2023-08-30 13:50:14,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-30 13:50:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-30 13:50:14,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1529 transitions. [2023-08-30 13:50:14,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3416759776536313 [2023-08-30 13:50:14,824 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 1529 transitions. [2023-08-30 13:50:14,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 1529 transitions. [2023-08-30 13:50:14,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:50:14,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1529 transitions. [2023-08-30 13:50:14,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 61.16) internal successors, (1529), 25 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:50:14,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 179.0) internal successors, (4654), 26 states have internal predecessors, (4654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:50:14,831 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 179.0) internal successors, (4654), 26 states have internal predecessors, (4654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:50:14,831 INFO L175 Difference]: Start difference. First operand has 141 places, 139 transitions, 1846 flow. Second operand 25 states and 1529 transitions. [2023-08-30 13:50:14,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 271 transitions, 3946 flow [2023-08-30 13:50:14,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 271 transitions, 3911 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 13:50:14,866 INFO L231 Difference]: Finished difference. Result has 181 places, 198 transitions, 3214 flow [2023-08-30 13:50:14,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1834, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3214, PETRI_PLACES=181, PETRI_TRANSITIONS=198} [2023-08-30 13:50:14,866 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 154 predicate places. [2023-08-30 13:50:14,866 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 198 transitions, 3214 flow [2023-08-30 13:50:14,867 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 13:50:14,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:50:14,867 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:50:14,873 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 13:50:15,073 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 13:50:15,073 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 13:50:15,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:50:15,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1296386046, now seen corresponding path program 2 times [2023-08-30 13:50:15,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:50:15,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722750935] [2023-08-30 13:50:15,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:50:15,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:50:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:50:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:50:15,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:50:15,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722750935] [2023-08-30 13:50:15,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722750935] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:50:15,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049018749] [2023-08-30 13:50:15,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 13:50:15,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:50:15,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:50:15,448 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 13:50:15,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-30 13:50:15,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 13:50:15,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 13:50:15,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 13:50:15,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:50:15,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 13:50:15,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:50:15,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 13:50:15,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-30 13:50:15,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 13:50:16,003 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:50:16,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:50:16,387 WARN L839 $PredicateComparison]: unable to prove that (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 (< (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|) 2147483647) (<= |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|)))) is different from false [2023-08-30 13:50:16,484 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:50:16,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049018749] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:50:16,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:50:16,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-08-30 13:50:16,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97878486] [2023-08-30 13:50:16,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:50:16,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 13:50:16,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:50:16,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 13:50:16,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=726, Unknown=1, NotChecked=56, Total=930 [2023-08-30 13:50:16,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 179 [2023-08-30 13:50:16,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 198 transitions, 3214 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 13:50:16,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:50:16,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 179 [2023-08-30 13:50:16,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:50:21,554 INFO L130 PetriNetUnfolder]: 823/1798 cut-off events. [2023-08-30 13:50:21,554 INFO L131 PetriNetUnfolder]: For 40615/40615 co-relation queries the response was YES. [2023-08-30 13:50:21,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13866 conditions, 1798 events. 823/1798 cut-off events. For 40615/40615 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11537 event pairs, 175 based on Foata normal form. 61/1859 useless extension candidates. Maximal degree in co-relation 13781. Up to 791 conditions per place. [2023-08-30 13:50:21,576 INFO L137 encePairwiseOnDemand]: 165/179 looper letters, 340 selfloop transitions, 266 changer transitions 0/606 dead transitions. [2023-08-30 13:50:21,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 606 transitions, 10413 flow [2023-08-30 13:50:21,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-08-30 13:50:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2023-08-30 13:50:21,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 3447 transitions. [2023-08-30 13:50:21,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3378418112319906 [2023-08-30 13:50:21,583 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 3447 transitions. [2023-08-30 13:50:21,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 3447 transitions. [2023-08-30 13:50:21,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:50:21,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 3447 transitions. [2023-08-30 13:50:21,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 60.473684210526315) internal successors, (3447), 57 states have internal predecessors, (3447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:50:21,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 179.0) internal successors, (10382), 58 states have internal predecessors, (10382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:50:21,602 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 179.0) internal successors, (10382), 58 states have internal predecessors, (10382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:50:21,602 INFO L175 Difference]: Start difference. First operand has 181 places, 198 transitions, 3214 flow. Second operand 57 states and 3447 transitions. [2023-08-30 13:50:21,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 606 transitions, 10413 flow [2023-08-30 13:50:21,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 606 transitions, 9946 flow, removed 163 selfloop flow, removed 4 redundant places. [2023-08-30 13:50:21,739 INFO L231 Difference]: Finished difference. Result has 270 places, 454 transitions, 8370 flow [2023-08-30 13:50:21,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=2904, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=8370, PETRI_PLACES=270, PETRI_TRANSITIONS=454} [2023-08-30 13:50:21,740 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 243 predicate places. [2023-08-30 13:50:21,740 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 454 transitions, 8370 flow [2023-08-30 13:50:21,741 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 13:50:21,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:50:21,741 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:50:21,747 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 13:50:21,946 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 13:50:21,947 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 13:50:21,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:50:21,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1176271910, now seen corresponding path program 1 times [2023-08-30 13:50:21,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:50:21,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787773150] [2023-08-30 13:50:21,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:50:21,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:50:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:50:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:50:22,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:50:22,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787773150] [2023-08-30 13:50:22,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787773150] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:50:22,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014832302] [2023-08-30 13:50:22,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:50:22,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:50:22,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:50:22,497 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 13:50:22,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-30 13:50:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:50:22,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-30 13:50:22,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:50:22,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 13:50:22,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:50:22,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 13:50:22,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-08-30 13:50:23,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 13:50:23,088 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:50:23,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:50:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:50:34,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014832302] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:50:34,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:50:34,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-30 13:50:34,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490100466] [2023-08-30 13:50:34,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:50:34,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-30 13:50:34,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:50:34,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-30 13:50:34,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=986, Unknown=7, NotChecked=0, Total=1190 [2023-08-30 13:50:36,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:50:38,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:50:40,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:50:42,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:50:44,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:50:46,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:50:48,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:50:50,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:50:52,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:50:54,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:50:57,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:50:59,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:51:01,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:51:03,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:51:05,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:51:07,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:51:09,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:51:11,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:51:13,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:51:16,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:51:16,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 179 [2023-08-30 13:51:16,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 454 transitions, 8370 flow. Second operand has 35 states, 35 states have (on average 50.285714285714285) internal successors, (1760), 35 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:51:16,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:51:16,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 179 [2023-08-30 13:51:16,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:51:27,111 WARN L222 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 13:51:30,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:51:32,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:51:34,102 INFO L130 PetriNetUnfolder]: 1015/2213 cut-off events. [2023-08-30 13:51:34,102 INFO L131 PetriNetUnfolder]: For 75786/75786 co-relation queries the response was YES. [2023-08-30 13:51:34,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20046 conditions, 2213 events. 1015/2213 cut-off events. For 75786/75786 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15098 event pairs, 219 based on Foata normal form. 30/2243 useless extension candidates. Maximal degree in co-relation 19922. Up to 1376 conditions per place. [2023-08-30 13:51:34,130 INFO L137 encePairwiseOnDemand]: 166/179 looper letters, 421 selfloop transitions, 288 changer transitions 0/709 dead transitions. [2023-08-30 13:51:34,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 709 transitions, 14246 flow [2023-08-30 13:51:34,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-30 13:51:34,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-30 13:51:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1416 transitions. [2023-08-30 13:51:34,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30425440481306404 [2023-08-30 13:51:34,140 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1416 transitions. [2023-08-30 13:51:34,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1416 transitions. [2023-08-30 13:51:34,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:51:34,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1416 transitions. [2023-08-30 13:51:34,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 54.46153846153846) internal successors, (1416), 26 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:51:34,150 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 13:51:34,150 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 13:51:34,150 INFO L175 Difference]: Start difference. First operand has 270 places, 454 transitions, 8370 flow. Second operand 26 states and 1416 transitions. [2023-08-30 13:51:34,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 709 transitions, 14246 flow [2023-08-30 13:51:34,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 709 transitions, 13116 flow, removed 565 selfloop flow, removed 0 redundant places. [2023-08-30 13:51:34,527 INFO L231 Difference]: Finished difference. Result has 308 places, 566 transitions, 10831 flow [2023-08-30 13:51:34,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=7467, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=10831, PETRI_PLACES=308, PETRI_TRANSITIONS=566} [2023-08-30 13:51:34,527 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 281 predicate places. [2023-08-30 13:51:34,527 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 566 transitions, 10831 flow [2023-08-30 13:51:34,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 50.285714285714285) internal successors, (1760), 35 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:51:34,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:51:34,528 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:51:34,533 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 13:51:34,728 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 13:51:34,729 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 13:51:34,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:51:34,729 INFO L85 PathProgramCache]: Analyzing trace with hash 752018124, now seen corresponding path program 1 times [2023-08-30 13:51:34,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:51:34,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861280832] [2023-08-30 13:51:34,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:51:34,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:51:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:51:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:51:35,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:51:35,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861280832] [2023-08-30 13:51:35,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861280832] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:51:35,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019814677] [2023-08-30 13:51:35,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:51:35,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:51:35,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:51:35,289 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 13:51:35,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-30 13:51:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:51:35,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 13:51:35,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:51:35,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 13:51:35,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:51:35,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 13:51:35,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-30 13:51:35,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 13:51:35,866 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:51:35,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:51:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:51:38,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019814677] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:51:38,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:51:38,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-08-30 13:51:38,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206267160] [2023-08-30 13:51:38,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:51:38,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 13:51:38,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:51:38,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 13:51:38,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=775, Unknown=5, NotChecked=0, Total=930 [2023-08-30 13:51:39,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 179 [2023-08-30 13:51:39,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 566 transitions, 10831 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 13:51:39,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:51:39,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 179 [2023-08-30 13:51:39,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:51:44,252 INFO L130 PetriNetUnfolder]: 1332/2890 cut-off events. [2023-08-30 13:51:44,253 INFO L131 PetriNetUnfolder]: For 128814/128814 co-relation queries the response was YES. [2023-08-30 13:51:44,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28086 conditions, 2890 events. 1332/2890 cut-off events. For 128814/128814 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 20752 event pairs, 206 based on Foata normal form. 55/2945 useless extension candidates. Maximal degree in co-relation 27947. Up to 1662 conditions per place. [2023-08-30 13:51:44,288 INFO L137 encePairwiseOnDemand]: 165/179 looper letters, 476 selfloop transitions, 384 changer transitions 0/860 dead transitions. [2023-08-30 13:51:44,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 860 transitions, 18732 flow [2023-08-30 13:51:44,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-30 13:51:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-30 13:51:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2141 transitions. [2023-08-30 13:51:44,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34173982442138867 [2023-08-30 13:51:44,292 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 2141 transitions. [2023-08-30 13:51:44,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 2141 transitions. [2023-08-30 13:51:44,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:51:44,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2141 transitions. [2023-08-30 13:51:44,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 61.17142857142857) internal successors, (2141), 35 states have internal predecessors, (2141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:51:44,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 179.0) internal successors, (6444), 36 states have internal predecessors, (6444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:51:44,302 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 179.0) internal successors, (6444), 36 states have internal predecessors, (6444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:51:44,302 INFO L175 Difference]: Start difference. First operand has 308 places, 566 transitions, 10831 flow. Second operand 35 states and 2141 transitions. [2023-08-30 13:51:44,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 860 transitions, 18732 flow [2023-08-30 13:51:45,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 860 transitions, 18264 flow, removed 208 selfloop flow, removed 5 redundant places. [2023-08-30 13:51:45,046 INFO L231 Difference]: Finished difference. Result has 357 places, 742 transitions, 16129 flow [2023-08-30 13:51:45,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=10581, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=234, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=16129, PETRI_PLACES=357, PETRI_TRANSITIONS=742} [2023-08-30 13:51:45,047 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 330 predicate places. [2023-08-30 13:51:45,047 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 742 transitions, 16129 flow [2023-08-30 13:51:45,048 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 13:51:45,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:51:45,048 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:51:45,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-08-30 13:51:45,253 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 13:51:45,254 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 13:51:45,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:51:45,254 INFO L85 PathProgramCache]: Analyzing trace with hash 576351473, now seen corresponding path program 1 times [2023-08-30 13:51:45,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:51:45,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383984006] [2023-08-30 13:51:45,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:51:45,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:51:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:51:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:51:45,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:51:45,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383984006] [2023-08-30 13:51:45,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383984006] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:51:45,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195829379] [2023-08-30 13:51:45,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:51:45,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:51:45,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:51:45,724 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 13:51:45,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-30 13:51:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:51:45,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 13:51:45,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:51:45,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 13:51:45,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:51:45,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 13:51:46,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-30 13:51:46,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 13:51:46,298 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:51:46,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:51:46,930 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 13:51:46,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195829379] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:51:46,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:51:46,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 28 [2023-08-30 13:51:46,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646544623] [2023-08-30 13:51:46,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:51:46,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 13:51:46,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:51:46,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 13:51:46,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=736, Unknown=2, NotChecked=0, Total=870 [2023-08-30 13:51:49,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:51:50,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 179 [2023-08-30 13:51:50,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 742 transitions, 16129 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 13:51:50,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:51:50,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 179 [2023-08-30 13:51:50,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:52:02,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:52:04,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:52:06,979 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 [0, 1] [2023-08-30 13:52:11,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:52:16,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:52:21,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:52:30,537 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 13:52:32,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:52:34,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:52:38,413 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 28 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1183 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1186 Int)) (or (< 0 (+ 2147483650 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1183)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1186))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1186 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| .cse1) (< 0 (+ 2147483650 (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1186) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1186 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1182 (Array Int Int))) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| .cse1) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1182) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1186) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|))))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (exists ((v_ArrVal_1183 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1183) (select |c_#memory_int| 1))))) is different from false [2023-08-30 13:52:43,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:52:45,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:52:48,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:52:50,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:52:52,835 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse2 (+ 28 |c_~#cache~0.offset|))) (and (<= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| (+ .cse0 |c_~#cache~0.offset|)) (forall ((v_ArrVal_1183 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1186 Int)) (or (< 0 (+ 2147483650 (select (select (let ((.cse1 (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_1183)))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1186))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| (+ .cse0 28 |c_~#cache~0.offset|)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1186 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| .cse2) (< 0 (+ 2147483650 (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1186) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|))))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= ((as const (Array Int Int)) 0) (store .cse3 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1186 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| .cse2) (< 0 (+ (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1186)) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|) 2147483650)))) (= |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_48| Int) (v_ArrVal_1186 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1182 (Array Int Int))) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| .cse2) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1182) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1186) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|))))) (<= 0 (+ 2147483649 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1|)))) is different from false [2023-08-30 13:52:56,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:53:00,028 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0)) (.cse4 (* |c_ULTIMATE.start_main_~i~2#1| 28)) (.cse5 (+ 28 |c_~#cache~0.offset|))) (and (= .cse0 (store .cse1 .cse2 0)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_1183 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1186 Int)) (or (< 0 (+ 2147483650 (select (select (let ((.cse3 (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_1183)))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1186))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| (+ .cse4 28 |c_~#cache~0.offset|)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1186 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| .cse5) (< 0 (+ 2147483650 (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1186) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (or (= .cse0 .cse1) (<= (+ .cse2 28) (+ .cse4 |c_~#cache~0.offset|))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1186 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1182 (Array Int Int))) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| .cse5) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1182) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1186) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|))))) (= |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|)) (exists ((v_ArrVal_1183 Int)) (= (store .cse0 0 v_ArrVal_1183) (select |c_#memory_int| 1)))))) is different from false [2023-08-30 13:53:05,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:53:07,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:53:08,505 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 28 |c_~#cache~0.offset|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_1183 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1186 Int)) (or (< 0 (+ 2147483650 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1183)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1186))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)))) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1186 Int)) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| .cse1) (< 0 (+ 2147483650 (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1186) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|))))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1186 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1182 (Array Int Int))) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| .cse1) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1182) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1186) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|))))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (<= 28 |c_ULTIMATE.start_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))))) is different from false [2023-08-30 13:53:11,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 [0, 1] [2023-08-30 13:53:13,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:53:15,859 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 13:53:18,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:53:20,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:53:22,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:53:25,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:53:27,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:53:29,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:53:31,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:53:33,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:53:36,652 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((v_ArrVal_1183 Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1186 Int)) (or (< 0 (+ 2147483650 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1183)))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1186))) |c_~#cache~0.base|) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|))) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) 28 |c_~#cache~0.offset|)))) (<= 1 |c_ULTIMATE.start_main_~i~2#1|) (= |c_~#cache~0.base| 1) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (forall ((|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| Int) (v_ArrVal_1186 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_42| Int) (v_ArrVal_1182 (Array Int Int))) (or (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_42| |c_#StackHeapBarrier|) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_42| v_ArrVal_1182) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1186) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_48|))))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0) (<= 28 |c_ULTIMATE.start_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)))) is different from false [2023-08-30 13:53:38,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:53:45,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:53:47,636 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 13:53:49,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:53:58,814 INFO L130 PetriNetUnfolder]: 1714/3684 cut-off events. [2023-08-30 13:53:58,814 INFO L131 PetriNetUnfolder]: For 233586/233586 co-relation queries the response was YES. [2023-08-30 13:53:58,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39510 conditions, 3684 events. 1714/3684 cut-off events. For 233586/233586 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 28048 event pairs, 265 based on Foata normal form. 84/3768 useless extension candidates. Maximal degree in co-relation 39354. Up to 2195 conditions per place. [2023-08-30 13:53:58,866 INFO L137 encePairwiseOnDemand]: 162/179 looper letters, 683 selfloop transitions, 683 changer transitions 1/1367 dead transitions. [2023-08-30 13:53:58,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 1367 transitions, 31044 flow [2023-08-30 13:53:58,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2023-08-30 13:53:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2023-08-30 13:53:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 5228 transitions. [2023-08-30 13:53:58,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.298027590924638 [2023-08-30 13:53:58,876 INFO L72 ComplementDD]: Start complementDD. Operand 98 states and 5228 transitions. [2023-08-30 13:53:58,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 5228 transitions. [2023-08-30 13:53:58,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:53:58,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 98 states and 5228 transitions. [2023-08-30 13:53:58,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 99 states, 98 states have (on average 53.3469387755102) internal successors, (5228), 98 states have internal predecessors, (5228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:53:58,900 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 13:53:58,902 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 13:53:58,903 INFO L175 Difference]: Start difference. First operand has 357 places, 742 transitions, 16129 flow. Second operand 98 states and 5228 transitions. [2023-08-30 13:53:58,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 1367 transitions, 31044 flow [2023-08-30 13:54:00,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 1367 transitions, 29460 flow, removed 775 selfloop flow, removed 2 redundant places. [2023-08-30 13:54:00,022 INFO L231 Difference]: Finished difference. Result has 502 places, 1136 transitions, 26604 flow [2023-08-30 13:54:00,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=14687, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=740, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=336, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=98, PETRI_FLOW=26604, PETRI_PLACES=502, PETRI_TRANSITIONS=1136} [2023-08-30 13:54:00,023 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 475 predicate places. [2023-08-30 13:54:00,023 INFO L495 AbstractCegarLoop]: Abstraction has has 502 places, 1136 transitions, 26604 flow [2023-08-30 13:54:00,023 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 13:54:00,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:54:00,024 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:54:00,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-30 13:54:00,229 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 13:54:00,229 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 13:54:00,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:54:00,229 INFO L85 PathProgramCache]: Analyzing trace with hash 574369660, now seen corresponding path program 3 times [2023-08-30 13:54:00,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:54:00,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042968122] [2023-08-30 13:54:00,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:54:00,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:54:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:54:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:54:00,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:54:00,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042968122] [2023-08-30 13:54:00,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042968122] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:54:00,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476631365] [2023-08-30 13:54:00,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 13:54:00,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:54:00,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:54:00,694 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 13:54:00,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-30 13:54:00,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 13:54:00,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 13:54:00,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 13:54:00,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:54:00,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 13:54:00,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:54:00,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 13:54:01,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-30 13:54:01,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 13:54:01,230 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:54:01,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:54:01,674 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1265 Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_43| Int) (|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| Int) (v_ArrVal_1262 (Array Int Int))) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_43| |c_#StackHeapBarrier|) (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_43| v_ArrVal_1262) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1265) |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50|) 2147483647) (< |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_50| (+ 28 |c_~#cache~0.offset|)))) is different from false [2023-08-30 13:54:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:54:01,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476631365] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:54:01,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:54:01,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 29 [2023-08-30 13:54:01,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840375276] [2023-08-30 13:54:01,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:54:01,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 13:54:01,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:54:01,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 13:54:01,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=681, Unknown=1, NotChecked=56, Total=930 [2023-08-30 13:54:01,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 179 [2023-08-30 13:54:01,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 1136 transitions, 26604 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 13:54:01,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:54:01,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 179 [2023-08-30 13:54:01,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:54:23,826 INFO L130 PetriNetUnfolder]: 2604/5691 cut-off events. [2023-08-30 13:54:23,826 INFO L131 PetriNetUnfolder]: For 549660/549660 co-relation queries the response was YES. [2023-08-30 13:54:23,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70580 conditions, 5691 events. 2604/5691 cut-off events. For 549660/549660 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 48162 event pairs, 208 based on Foata normal form. 232/5923 useless extension candidates. Maximal degree in co-relation 70373. Up to 1876 conditions per place. [2023-08-30 13:54:23,918 INFO L137 encePairwiseOnDemand]: 164/179 looper letters, 759 selfloop transitions, 1429 changer transitions 2/2190 dead transitions. [2023-08-30 13:54:23,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 2190 transitions, 54873 flow [2023-08-30 13:54:23,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-08-30 13:54:23,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2023-08-30 13:54:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 6088 transitions. [2023-08-30 13:54:23,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3334428743564465 [2023-08-30 13:54:23,925 INFO L72 ComplementDD]: Start complementDD. Operand 102 states and 6088 transitions. [2023-08-30 13:54:23,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 6088 transitions. [2023-08-30 13:54:23,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 13:54:23,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 102 states and 6088 transitions. [2023-08-30 13:54:23,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 103 states, 102 states have (on average 59.68627450980392) internal successors, (6088), 102 states have internal predecessors, (6088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:54:23,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 103 states, 103 states have (on average 179.0) internal successors, (18437), 103 states have internal predecessors, (18437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:54:23,991 INFO L81 ComplementDD]: Finished complementDD. Result has 103 states, 103 states have (on average 179.0) internal successors, (18437), 103 states have internal predecessors, (18437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 13:54:23,991 INFO L175 Difference]: Start difference. First operand has 502 places, 1136 transitions, 26604 flow. Second operand 102 states and 6088 transitions. [2023-08-30 13:54:23,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 2190 transitions, 54873 flow [2023-08-30 13:54:26,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 585 places, 2190 transitions, 49322 flow, removed 2638 selfloop flow, removed 13 redundant places. [2023-08-30 13:54:27,005 INFO L231 Difference]: Finished difference. Result has 635 places, 1896 transitions, 45131 flow [2023-08-30 13:54:27,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=21325, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1093, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=720, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=102, PETRI_FLOW=45131, PETRI_PLACES=635, PETRI_TRANSITIONS=1896} [2023-08-30 13:54:27,006 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 608 predicate places. [2023-08-30 13:54:27,006 INFO L495 AbstractCegarLoop]: Abstraction has has 635 places, 1896 transitions, 45131 flow [2023-08-30 13:54:27,007 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 13:54:27,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 13:54:27,007 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 13:54:27,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-30 13:54:27,208 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 13:54:27,209 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 13:54:27,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 13:54:27,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1909355565, now seen corresponding path program 1 times [2023-08-30 13:54:27,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 13:54:27,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726904981] [2023-08-30 13:54:27,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:54:27,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 13:54:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:54:27,634 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:54:27,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 13:54:27,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726904981] [2023-08-30 13:54:27,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726904981] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 13:54:27,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584844198] [2023-08-30 13:54:27,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 13:54:27,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 13:54:27,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 13:54:27,637 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 13:54:27,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-30 13:54:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 13:54:27,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 13:54:27,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 13:54:27,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 13:54:27,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 13:54:27,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 13:54:28,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-30 13:54:28,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-30 13:54:28,305 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:54:28,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 13:54:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 13:54:29,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584844198] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 13:54:29,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 13:54:29,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2023-08-30 13:54:29,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023055786] [2023-08-30 13:54:29,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 13:54:29,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 13:54:29,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 13:54:29,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 13:54:29,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=780, Unknown=5, NotChecked=0, Total=930 [2023-08-30 13:54:32,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 179 [2023-08-30 13:54:32,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 1896 transitions, 45131 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 13:54:32,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 13:54:32,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 179 [2023-08-30 13:54:32,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 13:54:32,410 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 28 |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1346 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1342) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse0))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1346 Int)) (or (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse0))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1344 Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ (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_1344)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)))))) is different from false [2023-08-30 13:54:39,753 WARN L222 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 71 DAG size of output: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 13:54:41,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:54:43,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:54:58,034 WARN L222 SmtUtils]: Spent 12.33s on a formula simplification. DAG size of input: 94 DAG size of output: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 13:55:08,491 WARN L222 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 13:55:19,498 WARN L222 SmtUtils]: Spent 10.28s on a formula simplification. DAG size of input: 90 DAG size of output: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 13:55:21,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:55:23,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:55:25,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:55:27,530 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 13:55:29,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:55:31,553 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 13:55:33,562 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 13:55:35,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:55:37,583 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 13:55:39,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:55:41,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:55:43,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:55:45,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 [0, 1] [2023-08-30 13:55:47,636 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 13:55:49,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:55:51,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:55:53,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:55:55,667 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 13:55:57,673 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 13:55:59,682 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 13:56:01,689 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 13:56:03,700 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 13:56:03,713 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1344 Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse0) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1344)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1346))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1346 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1342) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 28 |c_~#cache~0.offset|)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1344 Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse0) (< 0 (+ (select (store (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_1344)) |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)))) (= |c_~#cache~0.offset| 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (exists ((v_ArrVal_1344 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1344) (select |c_#memory_int| 1))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1344 Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse0) (< 0 (+ (select (store (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_1344)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)))))) is different from false [2023-08-30 13:56:08,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:56:10,509 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 13:56:12,514 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 13:56:14,525 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 13:56:16,534 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 13:56:18,545 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 13:56:20,551 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 13:56:22,559 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 13:56:24,566 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 13:56:26,573 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 13:56:28,584 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 13:56:30,595 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 13:56:33,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:56:35,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:56:37,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:56:39,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:56:41,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:56:43,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:56:45,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:57:01,366 WARN L222 SmtUtils]: Spent 10.25s on a formula simplification. DAG size of input: 67 DAG size of output: 65 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 13:57:13,412 WARN L222 SmtUtils]: Spent 6.55s on a formula simplification. DAG size of input: 89 DAG size of output: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 13:57:15,423 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 13:57:17,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:57:19,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:57:21,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:57:23,468 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 13:57:25,474 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 13:57:27,497 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 13:57:29,507 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 13:57:31,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:57:33,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:57:36,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:57:38,202 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 13:57:50,694 WARN L222 SmtUtils]: Spent 10.31s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 13:57:53,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:57:55,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:58:00,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:58:02,800 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse5 ((as const (Array Int Int)) 0))) (let ((.cse4 (+ 28 |c_~#cache~0.offset|)) (.cse6 (@diff .cse1 .cse5)) (.cse3 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (.cse0 (<= 0 (+ 2147483649 |c_ULTIMATE.start_cache_entry_addref_#t~post32#1|))) (.cse2 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse7 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse8 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and .cse0 (or (and (= (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) .cse2) .cse3) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1346 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1342) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse4))) (= .cse5 (store .cse1 .cse6 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1346 Int)) (or (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse4))) (or (<= (+ .cse6 28) (+ .cse7 |c_~#cache~0.offset|)) (= .cse5 .cse1)) (or (not .cse3) (and .cse0 .cse2)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1344 Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ .cse7 28 |c_~#cache~0.offset|)) (< 0 (+ (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1344)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)))) (<= 0 (+ (select .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483648))))) is different from false [2023-08-30 13:58:04,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:58:06,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:58:09,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:58:11,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 [0, 1] [2023-08-30 13:58:13,722 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 13:58:15,733 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 13:58:17,745 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 13:58:19,754 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 13:58:21,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:58:23,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:58:25,790 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 13:58:27,801 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 13:58:29,810 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 13:58:31,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:58:33,828 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 13:58:35,834 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 13:58:38,565 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 13:58:40,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:58:41,230 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse9 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse8 (@diff .cse4 .cse7)) (.cse6 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (.cse0 (<= 0 (+ 2147483649 |c_ULTIMATE.start_cache_entry_addref_#t~post32#1|))) (.cse5 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ .cse9 28 |c_~#cache~0.offset|)) (.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) .cse0 (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1344 Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse1) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1344)))) (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_1346))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)))) (= |c_~#cache~0.base| 1) (or (and (= (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) .cse5) .cse6) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1346 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1342) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 28 |c_~#cache~0.offset|)))) (= .cse7 (store .cse4 .cse8 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1344 Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse1) (< 0 (+ (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1344)) |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)))) (= |c_~#cache~0.offset| 0) (or (<= (+ .cse8 28) (+ .cse9 |c_~#cache~0.offset|)) (= .cse7 .cse4)) (or (not .cse6) (and .cse0 .cse5)) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (exists ((v_ArrVal_1344 Int)) (= (store .cse7 0 v_ArrVal_1344) (select |c_#memory_int| 1))) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1344 Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse1) (< 0 (+ (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1344)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)))) (<= 0 (+ (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483648))))) is different from false [2023-08-30 13:58:45,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:58:47,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:59:20,059 WARN L222 SmtUtils]: Spent 27.51s on a formula simplification. DAG size of input: 95 DAG size of output: 84 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 13:59:21,455 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 28 |c_~#cache~0.offset|)) (.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1344 Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse0) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1344)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1346))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1346 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1342) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse3))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1344 Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse0) (< 0 (+ (select (store (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_1344)) |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1346 Int)) (or (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse3))) (< 0 (+ (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483650)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1344 Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse0) (< 0 (+ (select (store (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_1344)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)))))) is different from false [2023-08-30 13:59:23,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:59:26,336 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 13:59:26,366 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1344 Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse0) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1344)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1346))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1346 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1342) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 28 |c_~#cache~0.offset|)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1344 Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse0) (< 0 (+ (select (store (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_1344)) |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)))) (= |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) (exists ((v_ArrVal_1344 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1344) (select |c_#memory_int| 1))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1344 Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse0) (< 0 (+ (select (store (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_1344)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)))))) is different from false [2023-08-30 13:59:26,407 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1344 Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse0) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1344)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1346))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1346 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1342) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 28 |c_~#cache~0.offset|)))) (= |c_~#cache~0.offset| 0) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (exists ((v_ArrVal_1344 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1344) (select |c_#memory_int| 1))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1344 Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse0) (< 0 (+ (select (store (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_1344)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)))) (<= 0 (+ (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483648)))) is different from false [2023-08-30 13:59:28,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:59:31,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:59:31,409 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse8 ((as const (Array Int Int)) 0))) (let ((.cse7 (+ 28 |c_~#cache~0.offset|)) (.cse9 (@diff .cse4 .cse8)) (.cse6 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset|)) (.cse0 (<= 0 (+ 2147483649 |c_ULTIMATE.start_cache_entry_addref_#t~post32#1|))) (.cse5 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|)) (.cse1 (+ .cse11 28 |c_~#cache~0.offset|)) (.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse10 (+ .cse11 |c_~#cache~0.offset|))) (and .cse0 (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1344 Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse1) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1344)))) (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_1346))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)))) (or (and (= (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) .cse5) .cse6) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1346 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1342) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse7))) (forall ((v_ArrVal_1346 Int)) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1346)) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) (= .cse8 (store .cse4 .cse9 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1344 Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse1) (< 0 (+ (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1344)) |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1346 Int)) (or (< 0 (+ (select (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse7))) (or (<= (+ .cse9 28) .cse10) (= .cse8 .cse4)) (or (not .cse6) (and .cse0 .cse5)) (= |c_~#cache~0.base| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1344 Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse1) (< 0 (+ (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1344)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)))) (<= 0 (+ (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483648)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse10) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store .cse4 |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1346)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)))))))) is different from false [2023-08-30 13:59:37,279 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1344 Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse0) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1344)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1346))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (|v_ULTIMATE.start_main_~#t1~0#1.base_44| Int) (v_ArrVal_1342 (Array Int Int)) (v_ArrVal_1346 Int)) (or (<= |v_ULTIMATE.start_main_~#t1~0#1.base_44| |c_#StackHeapBarrier|) (< 0 (+ (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_44| v_ArrVal_1342) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| (+ 28 |c_~#cache~0.offset|)))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0) (exists ((v_ArrVal_1344 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1344) (select |c_#memory_int| 1))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1344 Int) (v_ArrVal_1346 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| .cse0) (< 0 (+ (select (store (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_1344)) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1346) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|) 2147483650)))))) is different from false [2023-08-30 13:59:39,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 13:59:41,916 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 13:59:49,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 13:59:51,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 14:00:18,857 INFO L130 PetriNetUnfolder]: 3641/7974 cut-off events. [2023-08-30 14:00:18,858 INFO L131 PetriNetUnfolder]: For 788648/788648 co-relation queries the response was YES. [2023-08-30 14:00:18,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109109 conditions, 7974 events. 3641/7974 cut-off events. For 788648/788648 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 73218 event pairs, 464 based on Foata normal form. 96/8070 useless extension candidates. Maximal degree in co-relation 108859. Up to 3995 conditions per place. [2023-08-30 14:00:19,029 INFO L137 encePairwiseOnDemand]: 163/179 looper letters, 1663 selfloop transitions, 1588 changer transitions 28/3279 dead transitions. [2023-08-30 14:00:19,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 732 places, 3279 transitions, 89835 flow [2023-08-30 14:00:19,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2023-08-30 14:00:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2023-08-30 14:00:19,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 5429 transitions. [2023-08-30 14:00:19,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30329608938547487 [2023-08-30 14:00:19,039 INFO L72 ComplementDD]: Start complementDD. Operand 100 states and 5429 transitions. [2023-08-30 14:00:19,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 5429 transitions. [2023-08-30 14:00:19,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 14:00:19,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 100 states and 5429 transitions. [2023-08-30 14:00:19,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 101 states, 100 states have (on average 54.29) internal successors, (5429), 100 states have internal predecessors, (5429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 14:00:19,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 101 states, 101 states have (on average 179.0) internal successors, (18079), 101 states have internal predecessors, (18079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 14:00:19,063 INFO L81 ComplementDD]: Finished complementDD. Result has 101 states, 101 states have (on average 179.0) internal successors, (18079), 101 states have internal predecessors, (18079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 14:00:19,064 INFO L175 Difference]: Start difference. First operand has 635 places, 1896 transitions, 45131 flow. Second operand 100 states and 5429 transitions. [2023-08-30 14:00:19,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 732 places, 3279 transitions, 89835 flow [2023-08-30 14:00:29,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 3279 transitions, 76446 flow, removed 6535 selfloop flow, removed 23 redundant places. [2023-08-30 14:00:29,106 INFO L231 Difference]: Finished difference. Result has 770 places, 2698 transitions, 63731 flow [2023-08-30 14:00:29,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=39170, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1890, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=883, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=848, PETRI_DIFFERENCE_SUBTRAHEND_STATES=100, PETRI_FLOW=63731, PETRI_PLACES=770, PETRI_TRANSITIONS=2698} [2023-08-30 14:00:29,108 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 743 predicate places. [2023-08-30 14:00:29,108 INFO L495 AbstractCegarLoop]: Abstraction has has 770 places, 2698 transitions, 63731 flow [2023-08-30 14:00:29,108 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 14:00:29,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 14:00:29,109 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 14:00:29,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-08-30 14:00:29,314 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 14:00:29,314 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 14:00:29,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 14:00:29,314 INFO L85 PathProgramCache]: Analyzing trace with hash 667174738, now seen corresponding path program 2 times [2023-08-30 14:00:29,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 14:00:29,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577141618] [2023-08-30 14:00:29,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 14:00:29,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 14:00:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 14:00:29,812 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 14:00:29,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 14:00:29,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577141618] [2023-08-30 14:00:29,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577141618] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 14:00:29,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550132820] [2023-08-30 14:00:29,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 14:00:29,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 14:00:29,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 14:00:29,817 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 14:00:29,842 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 14:00:29,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 14:00:29,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 14:00:29,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 14:00:29,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 14:00:29,978 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 14:00:30,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 14:00:30,123 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 14:00:30,387 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 14:00:30,541 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 14:00:30,576 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 14:00:30,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 14:00:33,133 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 14:00:33,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550132820] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 14:00:33,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 14:00:33,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2023-08-30 14:00:33,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720135424] [2023-08-30 14:00:33,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 14:00:33,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 14:00:33,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 14:00:33,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 14:00:33,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=790, Unknown=3, NotChecked=0, Total=930 [2023-08-30 14:00:35,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 14:00:35,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 179 [2023-08-30 14:00:35,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 770 places, 2698 transitions, 63731 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 14:00:35,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 14:00:35,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 179 [2023-08-30 14:00:35,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 14:00:40,227 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse4 (+ 28 |c_~#cache~0.offset|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1424 Int) (v_ArrVal_1425 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| .cse0) (< (select (select (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1424)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1425))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 2147483647))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1424 Int) (v_ArrVal_1425 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| .cse0) (< (select (store (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_1424)) |c_~#cache~0.base|) .cse3 v_ArrVal_1425) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 2147483647))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1422 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1425 Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1422) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1425) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| .cse4) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|))) (exists ((v_ArrVal_1424 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1424) (select |c_#memory_int| 1))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1424 Int) (v_ArrVal_1425 Int)) (or (< (select (store (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1424) .cse3 v_ArrVal_1425) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| .cse4))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0))) is different from false [2023-08-30 14:00:48,117 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1424 Int) (v_ArrVal_1425 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| .cse0) (< (select (select (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1424)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1425))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 2147483647))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1424 Int) (v_ArrVal_1425 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| .cse0) (< (select (store (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_1424)) |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1425) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 2147483647))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1422 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1425 Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1422) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1425) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|))) (exists ((v_ArrVal_1424 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1424) (select |c_#memory_int| 1))) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0))) is different from false [2023-08-30 14:00:52,323 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 14:00:52,378 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1424 Int) (v_ArrVal_1425 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| .cse0) (< (select (select (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1424)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1425))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 2147483647))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1424 Int) (v_ArrVal_1425 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| .cse0) (< (select (store (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_1424)) |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1425) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 2147483647))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1422 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1425 Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1422) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1425) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|))) (exists ((v_ArrVal_1424 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1424) (select |c_#memory_int| 1))) (<= (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0))) is different from false [2023-08-30 14:00:54,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 14:00:56,017 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1424 Int) (v_ArrVal_1425 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 (select (let ((.cse0 (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_1424)))) (store .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1425))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 2147483647))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1422 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1425 Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1422) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1425) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1424 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1424) (select |c_#memory_int| 1))) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0)) is different from false [2023-08-30 14:00:56,065 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1424 Int) (v_ArrVal_1425 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| .cse0) (< (select (select (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1424)))) (store .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_ULTIMATE.start_cache_entry_addref_~entry#1.base|) |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| v_ArrVal_1425))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 2147483647))) (= |c_~#cache~0.base| 1) (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1424 Int) (v_ArrVal_1425 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| .cse0) (< (select (store (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_1424)) |c_~#cache~0.base|) (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|) v_ArrVal_1425) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 2147483647))) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1422 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_45| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1425 Int)) (or (< (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_45| v_ArrVal_1422) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1425) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (+ 28 |c_~#cache~0.offset|)) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_45| |c_#StackHeapBarrier|))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 1) (exists ((v_ArrVal_1424 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_1424) (select |c_#memory_int| 1))) (<= 28 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= |c_ULTIMATE.start_cache_entry_addref_~entry#1.offset| 0))) is different from false [2023-08-30 14:01:00,597 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 14:01:04,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 14:01:06,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 14:01:08,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 14:01:16,675 INFO L130 PetriNetUnfolder]: 4645/10118 cut-off events. [2023-08-30 14:01:16,676 INFO L131 PetriNetUnfolder]: For 942864/942864 co-relation queries the response was YES. [2023-08-30 14:01:16,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143220 conditions, 10118 events. 4645/10118 cut-off events. For 942864/942864 co-relation queries the response was YES. Maximal size of possible extension queue 960. Compared 95930 event pairs, 626 based on Foata normal form. 180/10298 useless extension candidates. Maximal degree in co-relation 142922. Up to 5775 conditions per place. [2023-08-30 14:01:16,906 INFO L137 encePairwiseOnDemand]: 162/179 looper letters, 2212 selfloop transitions, 1826 changer transitions 0/4038 dead transitions. [2023-08-30 14:01:16,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 851 places, 4038 transitions, 106938 flow [2023-08-30 14:01:16,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2023-08-30 14:01:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2023-08-30 14:01:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 4452 transitions. [2023-08-30 14:01:16,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30331107780351546 [2023-08-30 14:01:16,912 INFO L72 ComplementDD]: Start complementDD. Operand 82 states and 4452 transitions. [2023-08-30 14:01:16,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 4452 transitions. [2023-08-30 14:01:16,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 14:01:16,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 82 states and 4452 transitions. [2023-08-30 14:01:16,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 83 states, 82 states have (on average 54.292682926829265) internal successors, (4452), 82 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 14:01:16,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 83 states, 83 states have (on average 179.0) internal successors, (14857), 83 states have internal predecessors, (14857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 14:01:16,928 INFO L81 ComplementDD]: Finished complementDD. Result has 83 states, 83 states have (on average 179.0) internal successors, (14857), 83 states have internal predecessors, (14857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 14:01:16,928 INFO L175 Difference]: Start difference. First operand has 770 places, 2698 transitions, 63731 flow. Second operand 82 states and 4452 transitions. [2023-08-30 14:01:16,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 851 places, 4038 transitions, 106938 flow [2023-08-30 14:01:29,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 847 places, 4038 transitions, 104328 flow, removed 1273 selfloop flow, removed 4 redundant places. [2023-08-30 14:01:29,638 INFO L231 Difference]: Finished difference. Result has 906 places, 3510 transitions, 90913 flow [2023-08-30 14:01:29,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=61698, PETRI_DIFFERENCE_MINUEND_PLACES=766, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=82, PETRI_FLOW=90913, PETRI_PLACES=906, PETRI_TRANSITIONS=3510} [2023-08-30 14:01:29,642 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 879 predicate places. [2023-08-30 14:01:29,642 INFO L495 AbstractCegarLoop]: Abstraction has has 906 places, 3510 transitions, 90913 flow [2023-08-30 14:01:29,642 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 14:01:29,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 14:01:29,642 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 14:01:29,653 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 14:01:29,853 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 14:01:29,853 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-30 14:01:29,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 14:01:29,854 INFO L85 PathProgramCache]: Analyzing trace with hash 364134706, now seen corresponding path program 1 times [2023-08-30 14:01:29,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 14:01:29,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771910334] [2023-08-30 14:01:29,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 14:01:29,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 14:01:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 14:01:30,319 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 14:01:30,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 14:01:30,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771910334] [2023-08-30 14:01:30,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771910334] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 14:01:30,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940697135] [2023-08-30 14:01:30,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 14:01:30,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 14:01:30,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 14:01:30,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 14:01:30,350 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 14:01:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 14:01:30,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-30 14:01:30,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 14:01:30,478 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 14:01:30,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 14:01:30,593 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 14:01:30,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-08-30 14:01:31,018 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 14:01:31,079 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 14:01:31,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 14:01:36,876 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| Int) (v_ArrVal_1506 Int) (v_ArrVal_1502 (Array Int Int)) (|v_ULTIMATE.start_main_~#t1~0#1.base_46| Int) (v_ArrVal_1503 Int)) (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t1~0#1.base_46| v_ArrVal_1502) |c_~#cache~0.base|))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| (+ 28 |c_~#cache~0.offset|)) (< (select (store (store .cse0 |c_~#cache~0.offset| v_ArrVal_1503) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| v_ArrVal_1506) |c_~#cache~0.offset|) 2147483647) (<= |v_ULTIMATE.start_main_~#t1~0#1.base_46| |c_#StackHeapBarrier|) (< (+ (select .cse0 |c_~#cache~0.offset|) 1) v_ArrVal_1503)))) is different from false [2023-08-30 14:01:37,050 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 14:01:37,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940697135] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 14:01:37,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 14:01:37,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-08-30 14:01:37,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650768695] [2023-08-30 14:01:37,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 14:01:37,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-30 14:01:37,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 14:01:37,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-30 14:01:37,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=932, Unknown=2, NotChecked=64, Total=1190 [2023-08-30 14:01:37,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 179 [2023-08-30 14:01:37,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 906 places, 3510 transitions, 90913 flow. Second operand has 35 states, 35 states have (on average 50.285714285714285) internal successors, (1760), 35 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 14:01:37,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 14:01:37,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 179 [2023-08-30 14:01:37,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 14:01:43,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 [0, 1] [2023-08-30 14:01:45,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 14:01:47,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 14:01:48,869 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 14:01:58,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 14:02:00,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 14:02:02,635 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse7 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse0 (+ .cse7 28 |c_~#cache~0.offset|)) (.cse3 (+ 28 |c_~#cache~0.offset|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#cache~0.offset|)) (.cse4 (+ (select .cse5 |c_~#cache~0.offset|) 1))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| Int) (v_ArrVal_1506 Int) (v_ArrVal_1503 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| .cse0) (< (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1) v_ArrVal_1503) (< (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_1503)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| v_ArrVal_1506) .cse2) 2147483647))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| Int) (v_ArrVal_1506 Int) (v_ArrVal_1503 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| .cse3) (< .cse4 v_ArrVal_1503) (< (select (store (store .cse5 |c_~#cache~0.offset| v_ArrVal_1503) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| v_ArrVal_1506) |c_~#cache~0.offset|) 2147483647))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| Int) (v_ArrVal_1506 Int) (v_ArrVal_1503 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| .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_1503)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| v_ArrVal_1506) .cse2) 2147483647) (< (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| 1) v_ArrVal_1503))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| Int) (v_ArrVal_1506 Int) (v_ArrVal_1503 Int)) (let ((.cse6 (+ .cse7 |c_~#cache~0.offset|))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| .cse0) (< (select (store (store .cse5 .cse6 v_ArrVal_1503) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| v_ArrVal_1506) .cse2) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1503)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| Int) (v_ArrVal_1506 Int) (v_ArrVal_1503 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| .cse3) (< (select (store (store .cse5 |c_~#cache~0.offset| v_ArrVal_1503) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_72| v_ArrVal_1506) .cse2) 2147483647) (< .cse4 v_ArrVal_1503)))))) is different from false [2023-08-30 14:02:04,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 [0, 1] [2023-08-30 14:02:06,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] Killed by 15