/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 16:59:49,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 16:59:49,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 16:59:49,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 16:59:49,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 16:59:49,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 16:59:49,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 16:59:49,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 16:59:49,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 16:59:49,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 16:59:49,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 16:59:49,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 16:59:49,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 16:59:49,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 16:59:49,799 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 16:59:49,800 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 16:59:49,801 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 16:59:49,802 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 16:59:49,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 16:59:49,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 16:59:49,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 16:59:49,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 16:59:49,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 16:59:49,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 16:59:49,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 16:59:49,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 16:59:49,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 16:59:49,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 16:59:49,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 16:59:49,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 16:59:49,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 16:59:49,836 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 16:59:49,837 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 16:59:49,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 16:59:49,839 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 16:59:49,839 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 16:59:49,840 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 16:59:49,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 16:59:49,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 16:59:49,841 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 16:59:49,842 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 16:59:49,843 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 16:59:49,871 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 16:59:49,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 16:59:49,871 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 16:59:49,872 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 16:59:49,872 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 16:59:49,873 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 16:59:49,873 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 16:59:49,874 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 16:59:49,874 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 16:59:49,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 16:59:49,875 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 16:59:49,875 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 16:59:49,875 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 16:59:49,875 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 16:59:49,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 16:59:49,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 16:59:49,876 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 16:59:49,876 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 16:59:49,877 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 16:59:49,877 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 16:59:49,877 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 16:59:49,877 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 16:59:49,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 16:59:49,878 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 16:59:49,878 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 16:59:49,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 16:59:49,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 16:59:49,879 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 16:59:49,879 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 16:59:49,879 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 16:59:49,880 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 16:59:49,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 16:59:49,880 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 16:59:49,880 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-10-16 16:59:50,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 16:59:50,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 16:59:50,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 16:59:50,313 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 16:59:50,314 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 16:59:50,315 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2022-10-16 16:59:50,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6a8ea4b/0afc72d1c451474eac9266244cd29735/FLAG6a275cadb [2022-10-16 16:59:51,002 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 16:59:51,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2022-10-16 16:59:51,016 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6a8ea4b/0afc72d1c451474eac9266244cd29735/FLAG6a275cadb [2022-10-16 16:59:51,341 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6a8ea4b/0afc72d1c451474eac9266244cd29735 [2022-10-16 16:59:51,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 16:59:51,352 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 16:59:51,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 16:59:51,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 16:59:51,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 16:59:51,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:59:51" (1/1) ... [2022-10-16 16:59:51,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7db2a517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:59:51, skipping insertion in model container [2022-10-16 16:59:51,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:59:51" (1/1) ... [2022-10-16 16:59:51,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 16:59:51,448 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 16:59:51,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2022-10-16 16:59:51,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 16:59:51,841 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 16:59:51,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[640,653] [2022-10-16 16:59:51,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 16:59:51,948 INFO L208 MainTranslator]: Completed translation [2022-10-16 16:59:51,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:59:51 WrapperNode [2022-10-16 16:59:51,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 16:59:51,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 16:59:51,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 16:59:51,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 16:59:51,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:59:51" (1/1) ... [2022-10-16 16:59:51,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:59:51" (1/1) ... [2022-10-16 16:59:52,008 INFO L138 Inliner]: procedures = 31, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 231 [2022-10-16 16:59:52,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 16:59:52,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 16:59:52,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 16:59:52,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 16:59:52,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:59:51" (1/1) ... [2022-10-16 16:59:52,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:59:51" (1/1) ... [2022-10-16 16:59:52,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:59:51" (1/1) ... [2022-10-16 16:59:52,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:59:51" (1/1) ... [2022-10-16 16:59:52,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:59:51" (1/1) ... [2022-10-16 16:59:52,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:59:51" (1/1) ... [2022-10-16 16:59:52,048 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:59:51" (1/1) ... [2022-10-16 16:59:52,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:59:51" (1/1) ... [2022-10-16 16:59:52,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 16:59:52,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 16:59:52,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 16:59:52,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 16:59:52,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:59:51" (1/1) ... [2022-10-16 16:59:52,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 16:59:52,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 16:59:52,104 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) [2022-10-16 16:59:52,128 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 [2022-10-16 16:59:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 16:59:52,179 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-10-16 16:59:52,180 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-10-16 16:59:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-10-16 16:59:52,180 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-10-16 16:59:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-10-16 16:59:52,180 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-10-16 16:59:52,180 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-10-16 16:59:52,181 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-10-16 16:59:52,181 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-10-16 16:59:52,181 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-10-16 16:59:52,181 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-10-16 16:59:52,181 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-10-16 16:59:52,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 16:59:52,182 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-10-16 16:59:52,182 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-10-16 16:59:52,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 16:59:52,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 16:59:52,182 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-10-16 16:59:52,182 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-10-16 16:59:52,269 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 16:59:52,272 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 16:59:52,810 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume !(1 == ~q_free~0); [2022-10-16 16:59:52,810 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##53: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-10-16 16:59:52,832 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 16:59:52,842 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 16:59:52,842 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-10-16 16:59:52,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:59:52 BoogieIcfgContainer [2022-10-16 16:59:52,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 16:59:52,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 16:59:52,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 16:59:52,852 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 16:59:52,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:59:51" (1/3) ... [2022-10-16 16:59:52,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f1d0f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:59:52, skipping insertion in model container [2022-10-16 16:59:52,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:59:51" (2/3) ... [2022-10-16 16:59:52,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f1d0f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:59:52, skipping insertion in model container [2022-10-16 16:59:52,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:59:52" (3/3) ... [2022-10-16 16:59:52,856 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2022-10-16 16:59:52,879 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 16:59:52,879 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-10-16 16:59:52,944 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 16:59:52,954 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=FINITE_AUTOMATA, 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;@1058e76e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 16:59:52,954 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-10-16 16:59:52,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 99 states have (on average 1.5454545454545454) internal successors, (153), 108 states have internal predecessors, (153), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-10-16 16:59:52,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 16:59:52,973 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:59:52,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:59:52,975 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 16:59:52,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:59:52,981 INFO L85 PathProgramCache]: Analyzing trace with hash 965633490, now seen corresponding path program 1 times [2022-10-16 16:59:52,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:59:52,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635802534] [2022-10-16 16:59:52,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:59:52,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:59:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:53,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 16:59:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:53,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 16:59:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:53,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 16:59:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:53,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 16:59:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:53,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 16:59:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:53,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-16 16:59:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:53,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 16:59:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 16:59:53,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:59:53,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635802534] [2022-10-16 16:59:53,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635802534] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:59:53,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:59:53,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 16:59:53,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117294309] [2022-10-16 16:59:53,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:59:53,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 16:59:53,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:59:53,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 16:59:53,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-16 16:59:53,855 INFO L87 Difference]: Start difference. First operand has 130 states, 99 states have (on average 1.5454545454545454) internal successors, (153), 108 states have internal predecessors, (153), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-16 16:59:54,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:59:54,710 INFO L93 Difference]: Finished difference Result 415 states and 607 transitions. [2022-10-16 16:59:54,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 16:59:54,713 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 61 [2022-10-16 16:59:54,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:59:54,729 INFO L225 Difference]: With dead ends: 415 [2022-10-16 16:59:54,730 INFO L226 Difference]: Without dead ends: 280 [2022-10-16 16:59:54,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-10-16 16:59:54,740 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 487 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 16:59:54,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 601 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 16:59:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-10-16 16:59:54,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 239. [2022-10-16 16:59:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 190 states have (on average 1.4421052631578948) internal successors, (274), 198 states have internal predecessors, (274), 27 states have call successors, (27), 14 states have call predecessors, (27), 16 states have return successors, (32), 28 states have call predecessors, (32), 27 states have call successors, (32) [2022-10-16 16:59:54,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 333 transitions. [2022-10-16 16:59:54,872 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 333 transitions. Word has length 61 [2022-10-16 16:59:54,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:59:54,873 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 333 transitions. [2022-10-16 16:59:54,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 5 states have internal predecessors, (47), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-16 16:59:54,875 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 333 transitions. [2022-10-16 16:59:54,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 16:59:54,887 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:59:54,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:59:54,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 16:59:54,889 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 16:59:54,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:59:54,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1168969490, now seen corresponding path program 1 times [2022-10-16 16:59:54,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:59:54,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819080249] [2022-10-16 16:59:54,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:59:54,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:59:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:55,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 16:59:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:55,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 16:59:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:55,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 16:59:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:55,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 16:59:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:55,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 16:59:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:55,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-16 16:59:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:55,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 16:59:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 16:59:55,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:59:55,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819080249] [2022-10-16 16:59:55,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819080249] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:59:55,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:59:55,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 16:59:55,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791869368] [2022-10-16 16:59:55,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:59:55,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 16:59:55,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:59:55,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 16:59:55,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-16 16:59:55,212 INFO L87 Difference]: Start difference. First operand 239 states and 333 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-16 16:59:56,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:59:56,017 INFO L93 Difference]: Finished difference Result 658 states and 923 transitions. [2022-10-16 16:59:56,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 16:59:56,018 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 61 [2022-10-16 16:59:56,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:59:56,024 INFO L225 Difference]: With dead ends: 658 [2022-10-16 16:59:56,024 INFO L226 Difference]: Without dead ends: 435 [2022-10-16 16:59:56,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-10-16 16:59:56,029 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 455 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 16:59:56,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 937 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 16:59:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-10-16 16:59:56,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 357. [2022-10-16 16:59:56,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 286 states have (on average 1.4335664335664335) internal successors, (410), 296 states have internal predecessors, (410), 40 states have call successors, (40), 21 states have call predecessors, (40), 25 states have return successors, (53), 42 states have call predecessors, (53), 40 states have call successors, (53) [2022-10-16 16:59:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 503 transitions. [2022-10-16 16:59:56,114 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 503 transitions. Word has length 61 [2022-10-16 16:59:56,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:59:56,115 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 503 transitions. [2022-10-16 16:59:56,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-16 16:59:56,115 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 503 transitions. [2022-10-16 16:59:56,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 16:59:56,117 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:59:56,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:59:56,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 16:59:56,118 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 16:59:56,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:59:56,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1186835760, now seen corresponding path program 1 times [2022-10-16 16:59:56,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:59:56,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675858830] [2022-10-16 16:59:56,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:59:56,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:59:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:56,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 16:59:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:56,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 16:59:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:56,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 16:59:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:56,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 16:59:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:56,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 16:59:56,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:56,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-16 16:59:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:56,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 16:59:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:56,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 16:59:56,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:59:56,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675858830] [2022-10-16 16:59:56,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675858830] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:59:56,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:59:56,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-16 16:59:56,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903400212] [2022-10-16 16:59:56,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:59:56,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-16 16:59:56,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:59:56,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-16 16:59:56,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-10-16 16:59:56,296 INFO L87 Difference]: Start difference. First operand 357 states and 503 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 7 states have internal predecessors, (47), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-10-16 16:59:57,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:59:57,913 INFO L93 Difference]: Finished difference Result 2019 states and 2867 transitions. [2022-10-16 16:59:57,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-10-16 16:59:57,914 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 7 states have internal predecessors, (47), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 61 [2022-10-16 16:59:57,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:59:57,931 INFO L225 Difference]: With dead ends: 2019 [2022-10-16 16:59:57,932 INFO L226 Difference]: Without dead ends: 1666 [2022-10-16 16:59:57,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-10-16 16:59:57,944 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 1703 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1721 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-10-16 16:59:57,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1721 Valid, 1364 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-10-16 16:59:57,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2022-10-16 16:59:58,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1444. [2022-10-16 16:59:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1168 states have (on average 1.3835616438356164) internal successors, (1616), 1193 states have internal predecessors, (1616), 150 states have call successors, (150), 104 states have call predecessors, (150), 120 states have return successors, (186), 148 states have call predecessors, (186), 150 states have call successors, (186) [2022-10-16 16:59:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1952 transitions. [2022-10-16 16:59:58,172 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1952 transitions. Word has length 61 [2022-10-16 16:59:58,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:59:58,172 INFO L495 AbstractCegarLoop]: Abstraction has 1444 states and 1952 transitions. [2022-10-16 16:59:58,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 7 states have internal predecessors, (47), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-10-16 16:59:58,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1952 transitions. [2022-10-16 16:59:58,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-10-16 16:59:58,175 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:59:58,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:59:58,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 16:59:58,176 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 16:59:58,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:59:58,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1687960756, now seen corresponding path program 1 times [2022-10-16 16:59:58,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:59:58,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083833476] [2022-10-16 16:59:58,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:59:58,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:59:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:58,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 16:59:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:58,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 16:59:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:58,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 16:59:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:58,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 16:59:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:58,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 16:59:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:58,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-10-16 16:59:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:58,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 16:59:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:58,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 16:59:58,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:59:58,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083833476] [2022-10-16 16:59:58,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083833476] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:59:58,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:59:58,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-16 16:59:58,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302442590] [2022-10-16 16:59:58,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:59:58,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-16 16:59:58,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:59:58,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-16 16:59:58,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-10-16 16:59:58,370 INFO L87 Difference]: Start difference. First operand 1444 states and 1952 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 16:59:58,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 16:59:58,925 INFO L93 Difference]: Finished difference Result 3026 states and 4120 transitions. [2022-10-16 16:59:58,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 16:59:58,926 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-10-16 16:59:58,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 16:59:58,939 INFO L225 Difference]: With dead ends: 3026 [2022-10-16 16:59:58,939 INFO L226 Difference]: Without dead ends: 1592 [2022-10-16 16:59:58,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-10-16 16:59:58,956 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 185 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 16:59:58,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 659 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 16:59:58,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2022-10-16 16:59:59,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1484. [2022-10-16 16:59:59,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1200 states have (on average 1.3683333333333334) internal successors, (1642), 1225 states have internal predecessors, (1642), 150 states have call successors, (150), 104 states have call predecessors, (150), 128 states have return successors, (194), 156 states have call predecessors, (194), 150 states have call successors, (194) [2022-10-16 16:59:59,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1986 transitions. [2022-10-16 16:59:59,136 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1986 transitions. Word has length 63 [2022-10-16 16:59:59,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 16:59:59,137 INFO L495 AbstractCegarLoop]: Abstraction has 1484 states and 1986 transitions. [2022-10-16 16:59:59,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 16:59:59,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1986 transitions. [2022-10-16 16:59:59,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-10-16 16:59:59,139 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 16:59:59,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 16:59:59,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 16:59:59,140 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 16:59:59,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 16:59:59,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1293593970, now seen corresponding path program 1 times [2022-10-16 16:59:59,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 16:59:59,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880472112] [2022-10-16 16:59:59,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 16:59:59,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 16:59:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:59,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 16:59:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:59,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 16:59:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:59,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 16:59:59,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:59,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 16:59:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:59,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 16:59:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:59,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-10-16 16:59:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:59,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 16:59:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 16:59:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 16:59:59,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 16:59:59,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880472112] [2022-10-16 16:59:59,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880472112] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 16:59:59,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 16:59:59,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-16 16:59:59,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935044492] [2022-10-16 16:59:59,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 16:59:59,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-16 16:59:59,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 16:59:59,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-16 16:59:59,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-10-16 16:59:59,289 INFO L87 Difference]: Start difference. First operand 1484 states and 1986 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-10-16 17:00:01,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:01,177 INFO L93 Difference]: Finished difference Result 5234 states and 7157 transitions. [2022-10-16 17:00:01,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-10-16 17:00:01,177 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 63 [2022-10-16 17:00:01,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:01,201 INFO L225 Difference]: With dead ends: 5234 [2022-10-16 17:00:01,201 INFO L226 Difference]: Without dead ends: 3760 [2022-10-16 17:00:01,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-10-16 17:00:01,214 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 1778 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1796 SdHoareTripleChecker+Valid, 1378 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:01,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1796 Valid, 1378 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-10-16 17:00:01,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3760 states. [2022-10-16 17:00:01,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3760 to 3309. [2022-10-16 17:00:01,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3309 states, 2664 states have (on average 1.3307057057057057) internal successors, (3545), 2710 states have internal predecessors, (3545), 345 states have call successors, (345), 245 states have call predecessors, (345), 294 states have return successors, (443), 355 states have call predecessors, (443), 345 states have call successors, (443) [2022-10-16 17:00:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3309 states to 3309 states and 4333 transitions. [2022-10-16 17:00:01,610 INFO L78 Accepts]: Start accepts. Automaton has 3309 states and 4333 transitions. Word has length 63 [2022-10-16 17:00:01,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:01,611 INFO L495 AbstractCegarLoop]: Abstraction has 3309 states and 4333 transitions. [2022-10-16 17:00:01,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-10-16 17:00:01,611 INFO L276 IsEmpty]: Start isEmpty. Operand 3309 states and 4333 transitions. [2022-10-16 17:00:01,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-10-16 17:00:01,613 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:01,614 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:00:01,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 17:00:01,614 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:00:01,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:01,615 INFO L85 PathProgramCache]: Analyzing trace with hash 612204921, now seen corresponding path program 1 times [2022-10-16 17:00:01,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:01,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492488567] [2022-10-16 17:00:01,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:01,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:01,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:01,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:01,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 17:00:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:01,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:01,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:01,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 17:00:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:01,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 17:00:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:01,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 17:00:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:01,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 17:00:01,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:01,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492488567] [2022-10-16 17:00:01,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492488567] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:01,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:01,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-16 17:00:01,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408063422] [2022-10-16 17:00:01,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:01,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-16 17:00:01,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:01,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-16 17:00:01,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-10-16 17:00:01,814 INFO L87 Difference]: Start difference. First operand 3309 states and 4333 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 17:00:02,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:02,629 INFO L93 Difference]: Finished difference Result 6996 states and 9257 transitions. [2022-10-16 17:00:02,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 17:00:02,630 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 79 [2022-10-16 17:00:02,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:02,659 INFO L225 Difference]: With dead ends: 6996 [2022-10-16 17:00:02,659 INFO L226 Difference]: Without dead ends: 3697 [2022-10-16 17:00:02,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-10-16 17:00:02,671 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 129 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:02,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 731 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 17:00:02,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2022-10-16 17:00:03,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 3439. [2022-10-16 17:00:03,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3439 states, 2768 states have (on average 1.3161127167630058) internal successors, (3643), 2814 states have internal predecessors, (3643), 345 states have call successors, (345), 245 states have call predecessors, (345), 320 states have return successors, (469), 381 states have call predecessors, (469), 345 states have call successors, (469) [2022-10-16 17:00:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3439 states to 3439 states and 4457 transitions. [2022-10-16 17:00:03,071 INFO L78 Accepts]: Start accepts. Automaton has 3439 states and 4457 transitions. Word has length 79 [2022-10-16 17:00:03,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:03,072 INFO L495 AbstractCegarLoop]: Abstraction has 3439 states and 4457 transitions. [2022-10-16 17:00:03,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 17:00:03,073 INFO L276 IsEmpty]: Start isEmpty. Operand 3439 states and 4457 transitions. [2022-10-16 17:00:03,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-10-16 17:00:03,075 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:03,075 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:00:03,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 17:00:03,075 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:00:03,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:03,076 INFO L85 PathProgramCache]: Analyzing trace with hash 860351415, now seen corresponding path program 1 times [2022-10-16 17:00:03,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:03,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85524612] [2022-10-16 17:00:03,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:03,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:03,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:03,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:03,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 17:00:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:03,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:03,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:03,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 17:00:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:03,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 17:00:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:03,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 17:00:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:03,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 17:00:03,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:03,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85524612] [2022-10-16 17:00:03,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85524612] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:03,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:03,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 17:00:03,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507735500] [2022-10-16 17:00:03,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:03,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 17:00:03,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:03,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 17:00:03,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-16 17:00:03,276 INFO L87 Difference]: Start difference. First operand 3439 states and 4457 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-16 17:00:04,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:04,250 INFO L93 Difference]: Finished difference Result 6774 states and 8788 transitions. [2022-10-16 17:00:04,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-16 17:00:04,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 79 [2022-10-16 17:00:04,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:04,275 INFO L225 Difference]: With dead ends: 6774 [2022-10-16 17:00:04,275 INFO L226 Difference]: Without dead ends: 3679 [2022-10-16 17:00:04,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2022-10-16 17:00:04,288 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 400 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:04,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 778 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 17:00:04,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3679 states. [2022-10-16 17:00:04,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3679 to 3112. [2022-10-16 17:00:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3112 states, 2517 states have (on average 1.3150576082638061) internal successors, (3310), 2553 states have internal predecessors, (3310), 307 states have call successors, (307), 219 states have call predecessors, (307), 282 states have return successors, (408), 340 states have call predecessors, (408), 307 states have call successors, (408) [2022-10-16 17:00:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 4025 transitions. [2022-10-16 17:00:04,673 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 4025 transitions. Word has length 79 [2022-10-16 17:00:04,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:04,674 INFO L495 AbstractCegarLoop]: Abstraction has 3112 states and 4025 transitions. [2022-10-16 17:00:04,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-16 17:00:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 4025 transitions. [2022-10-16 17:00:04,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-10-16 17:00:04,676 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:04,676 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:00:04,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 17:00:04,676 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:00:04,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:04,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1519882937, now seen corresponding path program 1 times [2022-10-16 17:00:04,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:04,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641861906] [2022-10-16 17:00:04,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:04,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:04,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:04,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:04,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 17:00:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:04,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:04,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:04,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 17:00:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:04,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 17:00:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:04,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 17:00:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-16 17:00:04,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:04,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641861906] [2022-10-16 17:00:04,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641861906] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:04,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:04,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 17:00:04,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761129687] [2022-10-16 17:00:04,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:04,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 17:00:04,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:04,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 17:00:04,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-10-16 17:00:04,802 INFO L87 Difference]: Start difference. First operand 3112 states and 4025 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-10-16 17:00:05,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:05,710 INFO L93 Difference]: Finished difference Result 9565 states and 12594 transitions. [2022-10-16 17:00:05,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 17:00:05,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 79 [2022-10-16 17:00:05,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:05,756 INFO L225 Difference]: With dead ends: 9565 [2022-10-16 17:00:05,756 INFO L226 Difference]: Without dead ends: 6464 [2022-10-16 17:00:05,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-10-16 17:00:05,770 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 382 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:05,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 622 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 17:00:05,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6464 states. [2022-10-16 17:00:06,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6464 to 6042. [2022-10-16 17:00:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6042 states, 4834 states have (on average 1.2941663218866364) internal successors, (6256), 4926 states have internal predecessors, (6256), 613 states have call successors, (613), 438 states have call predecessors, (613), 589 states have return successors, (961), 679 states have call predecessors, (961), 613 states have call successors, (961) [2022-10-16 17:00:06,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 7830 transitions. [2022-10-16 17:00:06,416 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 7830 transitions. Word has length 79 [2022-10-16 17:00:06,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:06,417 INFO L495 AbstractCegarLoop]: Abstraction has 6042 states and 7830 transitions. [2022-10-16 17:00:06,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-10-16 17:00:06,418 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 7830 transitions. [2022-10-16 17:00:06,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-10-16 17:00:06,419 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:06,420 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:00:06,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 17:00:06,420 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:00:06,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:06,421 INFO L85 PathProgramCache]: Analyzing trace with hash -866626569, now seen corresponding path program 1 times [2022-10-16 17:00:06,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:06,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883920515] [2022-10-16 17:00:06,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:06,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:06,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:06,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:06,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 17:00:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:06,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:06,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:06,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 17:00:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:06,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 17:00:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:06,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 17:00:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 17:00:06,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:06,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883920515] [2022-10-16 17:00:06,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883920515] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:06,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:06,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 17:00:06,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546866563] [2022-10-16 17:00:06,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:06,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 17:00:06,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:06,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 17:00:06,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 17:00:06,500 INFO L87 Difference]: Start difference. First operand 6042 states and 7830 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-16 17:00:07,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:07,094 INFO L93 Difference]: Finished difference Result 10891 states and 14110 transitions. [2022-10-16 17:00:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 17:00:07,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 79 [2022-10-16 17:00:07,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:07,130 INFO L225 Difference]: With dead ends: 10891 [2022-10-16 17:00:07,130 INFO L226 Difference]: Without dead ends: 4860 [2022-10-16 17:00:07,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-10-16 17:00:07,148 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 266 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:07,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 363 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 17:00:07,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4860 states. [2022-10-16 17:00:07,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4860 to 4531. [2022-10-16 17:00:07,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4531 states, 3643 states have (on average 1.2920669777655778) internal successors, (4707), 3706 states have internal predecessors, (4707), 452 states have call successors, (452), 325 states have call predecessors, (452), 430 states have return successors, (678), 500 states have call predecessors, (678), 452 states have call successors, (678) [2022-10-16 17:00:07,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 5837 transitions. [2022-10-16 17:00:07,677 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 5837 transitions. Word has length 79 [2022-10-16 17:00:07,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:07,678 INFO L495 AbstractCegarLoop]: Abstraction has 4531 states and 5837 transitions. [2022-10-16 17:00:07,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-16 17:00:07,678 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 5837 transitions. [2022-10-16 17:00:07,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-10-16 17:00:07,680 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:07,680 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:00:07,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 17:00:07,680 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:00:07,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:07,681 INFO L85 PathProgramCache]: Analyzing trace with hash -372325524, now seen corresponding path program 1 times [2022-10-16 17:00:07,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:07,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675961654] [2022-10-16 17:00:07,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:07,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:07,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:07,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:07,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 17:00:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:07,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:07,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:07,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 17:00:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:07,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 17:00:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:07,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 17:00:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:07,825 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 17:00:07,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:07,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675961654] [2022-10-16 17:00:07,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675961654] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:07,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 17:00:07,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-10-16 17:00:07,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596390258] [2022-10-16 17:00:07,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:07,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-16 17:00:07,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:07,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-16 17:00:07,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-10-16 17:00:07,827 INFO L87 Difference]: Start difference. First operand 4531 states and 5837 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-10-16 17:00:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:09,619 INFO L93 Difference]: Finished difference Result 11976 states and 15588 transitions. [2022-10-16 17:00:09,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-10-16 17:00:09,620 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2022-10-16 17:00:09,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:09,703 INFO L225 Difference]: With dead ends: 11976 [2022-10-16 17:00:09,703 INFO L226 Difference]: Without dead ends: 7456 [2022-10-16 17:00:09,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-10-16 17:00:09,725 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 1296 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:09,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 875 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-16 17:00:09,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7456 states. [2022-10-16 17:00:10,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7456 to 6949. [2022-10-16 17:00:10,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6949 states, 5485 states have (on average 1.2503190519598906) internal successors, (6858), 5590 states have internal predecessors, (6858), 740 states have call successors, (740), 507 states have call predecessors, (740), 718 states have return successors, (1149), 853 states have call predecessors, (1149), 740 states have call successors, (1149) [2022-10-16 17:00:10,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6949 states to 6949 states and 8747 transitions. [2022-10-16 17:00:10,535 INFO L78 Accepts]: Start accepts. Automaton has 6949 states and 8747 transitions. Word has length 80 [2022-10-16 17:00:10,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:10,537 INFO L495 AbstractCegarLoop]: Abstraction has 6949 states and 8747 transitions. [2022-10-16 17:00:10,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-10-16 17:00:10,538 INFO L276 IsEmpty]: Start isEmpty. Operand 6949 states and 8747 transitions. [2022-10-16 17:00:10,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-10-16 17:00:10,542 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:10,542 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:00:10,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 17:00:10,543 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:00:10,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:10,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2052489113, now seen corresponding path program 1 times [2022-10-16 17:00:10,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:10,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637516242] [2022-10-16 17:00:10,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:10,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:10,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:10,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:10,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 17:00:10,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:10,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:10,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:10,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 17:00:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:10,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 17:00:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:10,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-10-16 17:00:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:10,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 17:00:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:10,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 17:00:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:10,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:10,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:10,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 17:00:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:10,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-10-16 17:00:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-10-16 17:00:10,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:10,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637516242] [2022-10-16 17:00:10,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637516242] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:00:10,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391292066] [2022-10-16 17:00:10,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:10,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:00:10,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:00:10,740 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) [2022-10-16 17:00:10,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-16 17:00:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:10,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 17:00:10,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:00:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-10-16 17:00:11,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 17:00:11,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391292066] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:11,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 17:00:11,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [10] total 11 [2022-10-16 17:00:11,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209188704] [2022-10-16 17:00:11,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:11,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 17:00:11,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:11,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 17:00:11,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:00:11,112 INFO L87 Difference]: Start difference. First operand 6949 states and 8747 transitions. Second operand has 3 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-10-16 17:00:12,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:12,193 INFO L93 Difference]: Finished difference Result 20676 states and 25921 transitions. [2022-10-16 17:00:12,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 17:00:12,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2022-10-16 17:00:12,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:12,265 INFO L225 Difference]: With dead ends: 20676 [2022-10-16 17:00:12,265 INFO L226 Difference]: Without dead ends: 13743 [2022-10-16 17:00:12,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:00:12,291 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 90 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:12,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 362 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:00:12,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13743 states. [2022-10-16 17:00:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13743 to 13739. [2022-10-16 17:00:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13739 states, 10825 states have (on average 1.2284526558891455) internal successors, (13298), 11027 states have internal predecessors, (13298), 1473 states have call successors, (1473), 1014 states have call predecessors, (1473), 1436 states have return successors, (2291), 1699 states have call predecessors, (2291), 1473 states have call successors, (2291) [2022-10-16 17:00:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13739 states to 13739 states and 17062 transitions. [2022-10-16 17:00:13,836 INFO L78 Accepts]: Start accepts. Automaton has 13739 states and 17062 transitions. Word has length 106 [2022-10-16 17:00:13,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:13,837 INFO L495 AbstractCegarLoop]: Abstraction has 13739 states and 17062 transitions. [2022-10-16 17:00:13,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-10-16 17:00:13,838 INFO L276 IsEmpty]: Start isEmpty. Operand 13739 states and 17062 transitions. [2022-10-16 17:00:13,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-10-16 17:00:13,840 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:13,840 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:00:13,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 17:00:14,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-10-16 17:00:14,055 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:00:14,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:14,056 INFO L85 PathProgramCache]: Analyzing trace with hash 797347268, now seen corresponding path program 1 times [2022-10-16 17:00:14,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:14,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133057901] [2022-10-16 17:00:14,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:14,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:14,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:14,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:14,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 17:00:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:14,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:14,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:14,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 17:00:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:14,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 17:00:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:14,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-10-16 17:00:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:14,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 17:00:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:14,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-10-16 17:00:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:14,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:14,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:14,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 17:00:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:14,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-10-16 17:00:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:14,255 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-10-16 17:00:14,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:14,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133057901] [2022-10-16 17:00:14,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133057901] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:00:14,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330545404] [2022-10-16 17:00:14,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:14,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:00:14,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:00:14,258 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) [2022-10-16 17:00:14,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-16 17:00:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:14,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 17:00:14,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:00:14,529 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-10-16 17:00:14,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 17:00:14,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330545404] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:14,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 17:00:14,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [10] total 11 [2022-10-16 17:00:14,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196647463] [2022-10-16 17:00:14,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:14,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 17:00:14,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:14,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 17:00:14,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:00:14,532 INFO L87 Difference]: Start difference. First operand 13739 states and 17062 transitions. Second operand has 3 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-10-16 17:00:15,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:15,511 INFO L93 Difference]: Finished difference Result 13739 states and 17062 transitions. [2022-10-16 17:00:15,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 17:00:15,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2022-10-16 17:00:15,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:15,578 INFO L225 Difference]: With dead ends: 13739 [2022-10-16 17:00:15,578 INFO L226 Difference]: Without dead ends: 12373 [2022-10-16 17:00:15,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:00:15,592 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 88 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:15,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 158 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:00:15,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12373 states. [2022-10-16 17:00:16,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12373 to 12361. [2022-10-16 17:00:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12361 states, 9757 states have (on average 1.2265040483755252) internal successors, (11967), 9935 states have internal predecessors, (11967), 1310 states have call successors, (1310), 902 states have call predecessors, (1310), 1290 states have return successors, (2066), 1524 states have call predecessors, (2066), 1310 states have call successors, (2066) [2022-10-16 17:00:16,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12361 states to 12361 states and 15343 transitions. [2022-10-16 17:00:16,678 INFO L78 Accepts]: Start accepts. Automaton has 12361 states and 15343 transitions. Word has length 107 [2022-10-16 17:00:16,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:16,679 INFO L495 AbstractCegarLoop]: Abstraction has 12361 states and 15343 transitions. [2022-10-16 17:00:16,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2022-10-16 17:00:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 12361 states and 15343 transitions. [2022-10-16 17:00:16,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-10-16 17:00:16,684 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:16,684 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:00:16,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 17:00:16,898 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,SelfDestructingSolverStorable11 [2022-10-16 17:00:16,898 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:00:16,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:16,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1019989462, now seen corresponding path program 1 times [2022-10-16 17:00:16,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:16,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172291315] [2022-10-16 17:00:16,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:16,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:16,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:17,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:17,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:17,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 17:00:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:17,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:17,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:17,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 17:00:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:17,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 17:00:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:17,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 17:00:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:17,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 17:00:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:17,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-16 17:00:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:17,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 17:00:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:17,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:17,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:17,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-16 17:00:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:17,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-10-16 17:00:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:17,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-10-16 17:00:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:17,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-10-16 17:00:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-10-16 17:00:17,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:17,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172291315] [2022-10-16 17:00:17,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172291315] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:00:17,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380856460] [2022-10-16 17:00:17,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:17,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:00:17,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:00:17,144 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) [2022-10-16 17:00:17,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-16 17:00:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:17,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 17:00:17,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:00:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-10-16 17:00:17,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 17:00:17,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380856460] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:17,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 17:00:17,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 11 [2022-10-16 17:00:17,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946433744] [2022-10-16 17:00:17,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:17,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 17:00:17,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:17,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 17:00:17,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:00:17,640 INFO L87 Difference]: Start difference. First operand 12361 states and 15343 transitions. Second operand has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-10-16 17:00:19,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:19,215 INFO L93 Difference]: Finished difference Result 13124 states and 16265 transitions. [2022-10-16 17:00:19,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 17:00:19,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 151 [2022-10-16 17:00:19,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:19,265 INFO L225 Difference]: With dead ends: 13124 [2022-10-16 17:00:19,265 INFO L226 Difference]: Without dead ends: 13123 [2022-10-16 17:00:19,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:00:19,272 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 33 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:19,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 310 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:00:19,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13123 states. [2022-10-16 17:00:20,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13123 to 13117. [2022-10-16 17:00:20,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13117 states, 10349 states have (on average 1.2226302058169871) internal successors, (12653), 10531 states have internal predecessors, (12653), 1394 states have call successors, (1394), 958 states have call predecessors, (1394), 1370 states have return successors, (2200), 1628 states have call predecessors, (2200), 1394 states have call successors, (2200) [2022-10-16 17:00:20,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13117 states to 13117 states and 16247 transitions. [2022-10-16 17:00:20,264 INFO L78 Accepts]: Start accepts. Automaton has 13117 states and 16247 transitions. Word has length 151 [2022-10-16 17:00:20,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:20,264 INFO L495 AbstractCegarLoop]: Abstraction has 13117 states and 16247 transitions. [2022-10-16 17:00:20,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 35.5) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-10-16 17:00:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 13117 states and 16247 transitions. [2022-10-16 17:00:20,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-10-16 17:00:20,269 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:20,270 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:00:20,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-16 17:00:20,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:00:20,483 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:00:20,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:20,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1554902016, now seen corresponding path program 1 times [2022-10-16 17:00:20,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:20,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594821977] [2022-10-16 17:00:20,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:20,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:20,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:20,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:20,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 17:00:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:20,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:20,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:20,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 17:00:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:20,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 17:00:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:20,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 17:00:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:20,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 17:00:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:20,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-16 17:00:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:20,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 17:00:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:20,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:20,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:20,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-16 17:00:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:20,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-10-16 17:00:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:20,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-10-16 17:00:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:20,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-10-16 17:00:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-10-16 17:00:20,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:20,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594821977] [2022-10-16 17:00:20,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594821977] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:00:20,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900276396] [2022-10-16 17:00:20,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:20,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:00:20,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:00:20,676 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) [2022-10-16 17:00:20,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-16 17:00:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:20,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 17:00:20,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:00:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-10-16 17:00:20,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 17:00:20,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900276396] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:20,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 17:00:20,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 11 [2022-10-16 17:00:20,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294452015] [2022-10-16 17:00:20,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:20,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 17:00:20,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:20,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 17:00:20,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:00:20,966 INFO L87 Difference]: Start difference. First operand 13117 states and 16247 transitions. Second operand has 3 states, 2 states have (on average 36.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-10-16 17:00:22,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:22,208 INFO L93 Difference]: Finished difference Result 13117 states and 16247 transitions. [2022-10-16 17:00:22,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 17:00:22,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 36.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 152 [2022-10-16 17:00:22,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:22,267 INFO L225 Difference]: With dead ends: 13117 [2022-10-16 17:00:22,268 INFO L226 Difference]: Without dead ends: 13116 [2022-10-16 17:00:22,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:00:22,276 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:22,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:00:22,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13116 states. [2022-10-16 17:00:23,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13116 to 13116. [2022-10-16 17:00:23,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13116 states, 10349 states have (on average 1.2205043965600542) internal successors, (12631), 10530 states have internal predecessors, (12631), 1394 states have call successors, (1394), 958 states have call predecessors, (1394), 1370 states have return successors, (2200), 1628 states have call predecessors, (2200), 1394 states have call successors, (2200) [2022-10-16 17:00:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13116 states to 13116 states and 16225 transitions. [2022-10-16 17:00:23,507 INFO L78 Accepts]: Start accepts. Automaton has 13116 states and 16225 transitions. Word has length 152 [2022-10-16 17:00:23,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:23,508 INFO L495 AbstractCegarLoop]: Abstraction has 13116 states and 16225 transitions. [2022-10-16 17:00:23,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 36.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-10-16 17:00:23,508 INFO L276 IsEmpty]: Start isEmpty. Operand 13116 states and 16225 transitions. [2022-10-16 17:00:23,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-10-16 17:00:23,514 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:23,514 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:00:23,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 17:00:23,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:00:23,729 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:00:23,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:23,730 INFO L85 PathProgramCache]: Analyzing trace with hash -237713245, now seen corresponding path program 1 times [2022-10-16 17:00:23,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:23,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888480007] [2022-10-16 17:00:23,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:23,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 17:00:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 17:00:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 17:00:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 17:00:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 17:00:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-16 17:00:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 17:00:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-16 17:00:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-10-16 17:00:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-10-16 17:00:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-10-16 17:00:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-10-16 17:00:23,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:23,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888480007] [2022-10-16 17:00:23,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888480007] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:00:23,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087435534] [2022-10-16 17:00:23,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:23,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:00:23,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:00:23,955 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) [2022-10-16 17:00:23,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-16 17:00:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:24,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 17:00:24,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:00:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-10-16 17:00:24,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 17:00:24,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087435534] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:24,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 17:00:24,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 11 [2022-10-16 17:00:24,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490404906] [2022-10-16 17:00:24,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:24,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 17:00:24,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:24,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 17:00:24,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:00:24,230 INFO L87 Difference]: Start difference. First operand 13116 states and 16225 transitions. Second operand has 3 states, 2 states have (on average 39.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-10-16 17:00:25,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:25,363 INFO L93 Difference]: Finished difference Result 20081 states and 24865 transitions. [2022-10-16 17:00:25,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 17:00:25,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 39.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 162 [2022-10-16 17:00:25,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:25,453 INFO L225 Difference]: With dead ends: 20081 [2022-10-16 17:00:25,453 INFO L226 Difference]: Without dead ends: 20080 [2022-10-16 17:00:25,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:00:25,465 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 53 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:25,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 302 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:00:25,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20080 states. [2022-10-16 17:00:27,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20080 to 20059. [2022-10-16 17:00:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20059 states, 15807 states have (on average 1.2186373125830328) internal successors, (19263), 16101 states have internal predecessors, (19263), 2126 states have call successors, (2126), 1458 states have call predecessors, (2126), 2124 states have return successors, (3430), 2500 states have call predecessors, (3430), 2126 states have call successors, (3430) [2022-10-16 17:00:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20059 states to 20059 states and 24819 transitions. [2022-10-16 17:00:27,235 INFO L78 Accepts]: Start accepts. Automaton has 20059 states and 24819 transitions. Word has length 162 [2022-10-16 17:00:27,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:27,236 INFO L495 AbstractCegarLoop]: Abstraction has 20059 states and 24819 transitions. [2022-10-16 17:00:27,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 39.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-10-16 17:00:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 20059 states and 24819 transitions. [2022-10-16 17:00:27,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-10-16 17:00:27,243 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:27,243 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:00:27,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-10-16 17:00:27,457 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,SelfDestructingSolverStorable14 [2022-10-16 17:00:27,458 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:00:27,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:27,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1220824281, now seen corresponding path program 1 times [2022-10-16 17:00:27,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:27,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370916972] [2022-10-16 17:00:27,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:27,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 17:00:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 17:00:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 17:00:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 17:00:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 17:00:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-16 17:00:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 17:00:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-16 17:00:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-10-16 17:00:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-10-16 17:00:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-10-16 17:00:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-10-16 17:00:27,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:27,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370916972] [2022-10-16 17:00:27,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370916972] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:00:27,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113019715] [2022-10-16 17:00:27,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:27,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:00:27,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:00:27,666 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) [2022-10-16 17:00:27,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-16 17:00:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:27,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 17:00:27,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:00:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-10-16 17:00:27,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 17:00:27,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113019715] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:27,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 17:00:27,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 11 [2022-10-16 17:00:27,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265639525] [2022-10-16 17:00:27,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:27,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 17:00:27,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:27,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 17:00:27,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:00:27,974 INFO L87 Difference]: Start difference. First operand 20059 states and 24819 transitions. Second operand has 3 states, 2 states have (on average 39.5) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-10-16 17:00:29,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:29,309 INFO L93 Difference]: Finished difference Result 20059 states and 24819 transitions. [2022-10-16 17:00:29,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 17:00:29,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 39.5) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 163 [2022-10-16 17:00:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:29,393 INFO L225 Difference]: With dead ends: 20059 [2022-10-16 17:00:29,393 INFO L226 Difference]: Without dead ends: 20058 [2022-10-16 17:00:29,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:00:29,406 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:29,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 155 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:00:29,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20058 states. [2022-10-16 17:00:31,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20058 to 20058. [2022-10-16 17:00:31,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20058 states, 15807 states have (on average 1.217245524134877) internal successors, (19241), 16100 states have internal predecessors, (19241), 2126 states have call successors, (2126), 1458 states have call predecessors, (2126), 2124 states have return successors, (3430), 2500 states have call predecessors, (3430), 2126 states have call successors, (3430) [2022-10-16 17:00:31,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20058 states to 20058 states and 24797 transitions. [2022-10-16 17:00:31,460 INFO L78 Accepts]: Start accepts. Automaton has 20058 states and 24797 transitions. Word has length 163 [2022-10-16 17:00:31,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:31,463 INFO L495 AbstractCegarLoop]: Abstraction has 20058 states and 24797 transitions. [2022-10-16 17:00:31,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 39.5) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-10-16 17:00:31,464 INFO L276 IsEmpty]: Start isEmpty. Operand 20058 states and 24797 transitions. [2022-10-16 17:00:31,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-10-16 17:00:31,488 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:31,489 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:00:31,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-16 17:00:31,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-16 17:00:31,705 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:00:31,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:31,706 INFO L85 PathProgramCache]: Analyzing trace with hash -645869829, now seen corresponding path program 1 times [2022-10-16 17:00:31,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:31,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653801869] [2022-10-16 17:00:31,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:31,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 17:00:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 17:00:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 17:00:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 17:00:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 17:00:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-16 17:00:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 17:00:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-16 17:00:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-10-16 17:00:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-10-16 17:00:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-10-16 17:00:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-10-16 17:00:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-10-16 17:00:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-10-16 17:00:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-10-16 17:00:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-10-16 17:00:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-10-16 17:00:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-10-16 17:00:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:32,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-10-16 17:00:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:32,007 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 44 proven. 21 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2022-10-16 17:00:32,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:32,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653801869] [2022-10-16 17:00:32,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653801869] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:00:32,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034884628] [2022-10-16 17:00:32,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:32,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:00:32,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:00:32,010 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) [2022-10-16 17:00:32,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-16 17:00:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:32,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 17:00:32,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:00:32,332 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-10-16 17:00:32,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 17:00:32,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034884628] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:32,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 17:00:32,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-10-16 17:00:32,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379469486] [2022-10-16 17:00:32,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:32,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 17:00:32,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:32,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 17:00:32,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:00:32,340 INFO L87 Difference]: Start difference. First operand 20058 states and 24797 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-10-16 17:00:35,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:35,247 INFO L93 Difference]: Finished difference Result 57788 states and 71354 transitions. [2022-10-16 17:00:35,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 17:00:35,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 248 [2022-10-16 17:00:35,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:35,422 INFO L225 Difference]: With dead ends: 57788 [2022-10-16 17:00:35,422 INFO L226 Difference]: Without dead ends: 38241 [2022-10-16 17:00:35,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:00:35,495 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 72 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:35,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 304 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:00:35,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38241 states. [2022-10-16 17:00:38,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38241 to 37980. [2022-10-16 17:00:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37980 states, 29903 states have (on average 1.2105474367120357) internal successors, (36199), 30486 states have internal predecessors, (36199), 3996 states have call successors, (3996), 2916 states have call predecessors, (3996), 4080 states have return successors, (6102), 4578 states have call predecessors, (6102), 3996 states have call successors, (6102) [2022-10-16 17:00:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37980 states to 37980 states and 46297 transitions. [2022-10-16 17:00:38,898 INFO L78 Accepts]: Start accepts. Automaton has 37980 states and 46297 transitions. Word has length 248 [2022-10-16 17:00:38,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:38,899 INFO L495 AbstractCegarLoop]: Abstraction has 37980 states and 46297 transitions. [2022-10-16 17:00:38,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-10-16 17:00:38,899 INFO L276 IsEmpty]: Start isEmpty. Operand 37980 states and 46297 transitions. [2022-10-16 17:00:38,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2022-10-16 17:00:38,939 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:38,940 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:00:38,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-10-16 17:00:39,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:00:39,155 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:00:39,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:39,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1532819100, now seen corresponding path program 1 times [2022-10-16 17:00:39,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:39,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408559441] [2022-10-16 17:00:39,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:39,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 17:00:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 17:00:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 17:00:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 17:00:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 17:00:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-16 17:00:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 17:00:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 17:00:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-10-16 17:00:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-10-16 17:00:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-10-16 17:00:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-10-16 17:00:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-10-16 17:00:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-10-16 17:00:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-10-16 17:00:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-10-16 17:00:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-10-16 17:00:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-10-16 17:00:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-10-16 17:00:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-10-16 17:00:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-10-16 17:00:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,603 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 44 proven. 21 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2022-10-16 17:00:39,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:39,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408559441] [2022-10-16 17:00:39,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408559441] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:00:39,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111779052] [2022-10-16 17:00:39,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:39,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:00:39,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:00:39,606 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) [2022-10-16 17:00:39,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-16 17:00:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:39,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 17:00:39,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:00:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-10-16 17:00:39,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 17:00:39,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111779052] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:39,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 17:00:39,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-10-16 17:00:39,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741009715] [2022-10-16 17:00:39,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:39,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 17:00:39,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:39,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 17:00:39,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:00:39,956 INFO L87 Difference]: Start difference. First operand 37980 states and 46297 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-10-16 17:00:45,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:45,331 INFO L93 Difference]: Finished difference Result 111354 states and 136354 transitions. [2022-10-16 17:00:45,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 17:00:45,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 282 [2022-10-16 17:00:45,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:45,676 INFO L225 Difference]: With dead ends: 111354 [2022-10-16 17:00:45,676 INFO L226 Difference]: Without dead ends: 73385 [2022-10-16 17:00:45,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:00:45,781 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 62 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:45,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 304 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:00:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73385 states. [2022-10-16 17:00:51,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73385 to 73384. [2022-10-16 17:00:52,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73384 states, 57789 states have (on average 1.1975808544878783) internal successors, (69207), 58878 states have internal predecessors, (69207), 7890 states have call successors, (7890), 5832 states have call predecessors, (7890), 7704 states have return successors, (11313), 8674 states have call predecessors, (11313), 7890 states have call successors, (11313) [2022-10-16 17:00:52,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73384 states to 73384 states and 88410 transitions. [2022-10-16 17:00:52,504 INFO L78 Accepts]: Start accepts. Automaton has 73384 states and 88410 transitions. Word has length 282 [2022-10-16 17:00:52,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:00:52,505 INFO L495 AbstractCegarLoop]: Abstraction has 73384 states and 88410 transitions. [2022-10-16 17:00:52,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-10-16 17:00:52,506 INFO L276 IsEmpty]: Start isEmpty. Operand 73384 states and 88410 transitions. [2022-10-16 17:00:52,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2022-10-16 17:00:52,541 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:00:52,541 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:00:52,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-16 17:00:52,755 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,SelfDestructingSolverStorable17 [2022-10-16 17:00:52,755 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:00:52,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:00:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash 584767134, now seen corresponding path program 1 times [2022-10-16 17:00:52,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:00:52,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134312048] [2022-10-16 17:00:52,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:52,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:00:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:52,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:00:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:52,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:52,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 17:00:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:52,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:52,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:00:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:52,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 17:00:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:52,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 17:00:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:52,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 17:00:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 17:00:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-16 17:00:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 17:00:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 17:00:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-10-16 17:00:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-10-16 17:00:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-10-16 17:00:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-10-16 17:00:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-10-16 17:00:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-10-16 17:00:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-10-16 17:00:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-10-16 17:00:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-10-16 17:00:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:00:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:00:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-10-16 17:00:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-10-16 17:00:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-10-16 17:00:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-10-16 17:00:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 44 proven. 21 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2022-10-16 17:00:53,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:00:53,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134312048] [2022-10-16 17:00:53,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134312048] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:00:53,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398123064] [2022-10-16 17:00:53,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:00:53,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:00:53,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:00:53,076 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) [2022-10-16 17:00:53,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-16 17:00:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:00:53,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 17:00:53,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:00:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-10-16 17:00:53,254 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 17:00:53,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398123064] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:00:53,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 17:00:53,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-10-16 17:00:53,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36372463] [2022-10-16 17:00:53,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:00:53,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 17:00:53,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:00:53,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 17:00:53,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:00:53,256 INFO L87 Difference]: Start difference. First operand 73384 states and 88410 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-10-16 17:00:57,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:00:57,384 INFO L93 Difference]: Finished difference Result 106984 states and 128628 transitions. [2022-10-16 17:00:57,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 17:00:57,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 282 [2022-10-16 17:00:57,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:00:57,566 INFO L225 Difference]: With dead ends: 106984 [2022-10-16 17:00:57,566 INFO L226 Difference]: Without dead ends: 47199 [2022-10-16 17:00:57,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:00:57,889 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 120 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:00:57,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 411 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:00:57,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47199 states. [2022-10-16 17:01:01,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47199 to 34834. [2022-10-16 17:01:01,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34834 states, 27550 states have (on average 1.161633393829401) internal successors, (32003), 27979 states have internal predecessors, (32003), 3783 states have call successors, (3783), 2848 states have call predecessors, (3783), 3500 states have return successors, (5052), 4007 states have call predecessors, (5052), 3783 states have call successors, (5052) [2022-10-16 17:01:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34834 states to 34834 states and 40838 transitions. [2022-10-16 17:01:01,348 INFO L78 Accepts]: Start accepts. Automaton has 34834 states and 40838 transitions. Word has length 282 [2022-10-16 17:01:01,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:01,349 INFO L495 AbstractCegarLoop]: Abstraction has 34834 states and 40838 transitions. [2022-10-16 17:01:01,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-10-16 17:01:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 34834 states and 40838 transitions. [2022-10-16 17:01:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2022-10-16 17:01:01,381 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:01,381 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:01,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-16 17:01:01,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:01:01,596 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:01,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:01,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1526530276, now seen corresponding path program 1 times [2022-10-16 17:01:01,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:01,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735524035] [2022-10-16 17:01:01,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:01,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 17:01:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:01:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 17:01:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 17:01:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 17:01:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 17:01:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-16 17:01:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 17:01:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:01:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 17:01:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-10-16 17:01:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-10-16 17:01:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-10-16 17:01:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:01:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:01:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-10-16 17:01:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-10-16 17:01:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-10-16 17:01:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-10-16 17:01:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-10-16 17:01:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-10-16 17:01:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:01:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:01:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-10-16 17:01:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-10-16 17:01:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-10-16 17:01:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-10-16 17:01:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:01,900 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 44 proven. 21 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2022-10-16 17:01:01,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:01,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735524035] [2022-10-16 17:01:01,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735524035] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:01:01,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257218217] [2022-10-16 17:01:01,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:01,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:01:01,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:01:01,903 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) [2022-10-16 17:01:01,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-10-16 17:01:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:02,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 17:01:02,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:01:02,104 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2022-10-16 17:01:02,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 17:01:02,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257218217] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:02,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 17:01:02,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-10-16 17:01:02,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354458015] [2022-10-16 17:01:02,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:02,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 17:01:02,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:02,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 17:01:02,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:01:02,111 INFO L87 Difference]: Start difference. First operand 34834 states and 40838 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-10-16 17:01:04,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:04,361 INFO L93 Difference]: Finished difference Result 56341 states and 65950 transitions. [2022-10-16 17:01:04,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 17:01:04,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 282 [2022-10-16 17:01:04,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:04,441 INFO L225 Difference]: With dead ends: 56341 [2022-10-16 17:01:04,441 INFO L226 Difference]: Without dead ends: 21518 [2022-10-16 17:01:04,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:01:04,494 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 14 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:04,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 331 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:01:04,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21518 states. [2022-10-16 17:01:06,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21518 to 21518. [2022-10-16 17:01:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21518 states, 17002 states have (on average 1.1442771438654276) internal successors, (19455), 17259 states have internal predecessors, (19455), 2255 states have call successors, (2255), 1832 states have call predecessors, (2255), 2260 states have return successors, (2970), 2427 states have call predecessors, (2970), 2255 states have call successors, (2970) [2022-10-16 17:01:06,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21518 states to 21518 states and 24680 transitions. [2022-10-16 17:01:06,374 INFO L78 Accepts]: Start accepts. Automaton has 21518 states and 24680 transitions. Word has length 282 [2022-10-16 17:01:06,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:06,375 INFO L495 AbstractCegarLoop]: Abstraction has 21518 states and 24680 transitions. [2022-10-16 17:01:06,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 3 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-10-16 17:01:06,375 INFO L276 IsEmpty]: Start isEmpty. Operand 21518 states and 24680 transitions. [2022-10-16 17:01:06,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2022-10-16 17:01:06,397 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:06,398 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:06,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-10-16 17:01:06,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:01:06,613 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:06,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:06,614 INFO L85 PathProgramCache]: Analyzing trace with hash 192555199, now seen corresponding path program 1 times [2022-10-16 17:01:06,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:06,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709667057] [2022-10-16 17:01:06,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:06,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 17:01:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:01:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 17:01:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 17:01:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 17:01:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 17:01:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-16 17:01:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 17:01:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:01:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 17:01:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-10-16 17:01:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-10-16 17:01:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-10-16 17:01:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:01:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:01:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-10-16 17:01:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-10-16 17:01:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-10-16 17:01:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-10-16 17:01:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-10-16 17:01:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-10-16 17:01:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:01:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 17:01:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-10-16 17:01:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-10-16 17:01:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-10-16 17:01:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:01:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:01:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-10-16 17:01:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-10-16 17:01:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:06,901 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 44 proven. 21 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2022-10-16 17:01:06,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:06,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709667057] [2022-10-16 17:01:06,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709667057] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:01:06,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492448192] [2022-10-16 17:01:06,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:06,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:01:06,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:01:06,903 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) [2022-10-16 17:01:06,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-10-16 17:01:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:07,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 17:01:07,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:01:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2022-10-16 17:01:07,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 17:01:07,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492448192] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:07,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 17:01:07,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-10-16 17:01:07,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794717793] [2022-10-16 17:01:07,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:07,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 17:01:07,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:07,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 17:01:07,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:01:07,192 INFO L87 Difference]: Start difference. First operand 21518 states and 24680 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-10-16 17:01:09,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:09,645 INFO L93 Difference]: Finished difference Result 40972 states and 47306 transitions. [2022-10-16 17:01:09,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 17:01:09,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 314 [2022-10-16 17:01:09,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:09,697 INFO L225 Difference]: With dead ends: 40972 [2022-10-16 17:01:09,697 INFO L226 Difference]: Without dead ends: 16542 [2022-10-16 17:01:09,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:01:09,732 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 46 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:09,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 410 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:01:09,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16542 states. [2022-10-16 17:01:11,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16542 to 16405. [2022-10-16 17:01:11,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16405 states, 12875 states have (on average 1.1533980582524272) internal successors, (14850), 13051 states have internal predecessors, (14850), 1754 states have call successors, (1754), 1404 states have call predecessors, (1754), 1775 states have return successors, (2299), 1950 states have call predecessors, (2299), 1754 states have call successors, (2299) [2022-10-16 17:01:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16405 states to 16405 states and 18903 transitions. [2022-10-16 17:01:11,461 INFO L78 Accepts]: Start accepts. Automaton has 16405 states and 18903 transitions. Word has length 314 [2022-10-16 17:01:11,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:11,463 INFO L495 AbstractCegarLoop]: Abstraction has 16405 states and 18903 transitions. [2022-10-16 17:01:11,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-10-16 17:01:11,463 INFO L276 IsEmpty]: Start isEmpty. Operand 16405 states and 18903 transitions. [2022-10-16 17:01:11,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2022-10-16 17:01:11,477 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 17:01:11,477 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:01:11,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-10-16 17:01:11,685 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,SelfDestructingSolverStorable20 [2022-10-16 17:01:11,686 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-10-16 17:01:11,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 17:01:11,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1328339250, now seen corresponding path program 1 times [2022-10-16 17:01:11,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 17:01:11,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302998957] [2022-10-16 17:01:11,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:11,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 17:01:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-16 17:01:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 17:01:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:01:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-10-16 17:01:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-10-16 17:01:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 17:01:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 17:01:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-10-16 17:01:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-10-16 17:01:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 17:01:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:01:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 17:01:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-10-16 17:01:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-10-16 17:01:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-10-16 17:01:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:01:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:01:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-10-16 17:01:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-10-16 17:01:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-10-16 17:01:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-10-16 17:01:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-10-16 17:01:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-10-16 17:01:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:01:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-10-16 17:01:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-10-16 17:01:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-10-16 17:01:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:11,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-10-16 17:01:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:12,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 17:01:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:12,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-16 17:01:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:12,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-10-16 17:01:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:12,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2022-10-16 17:01:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 44 proven. 21 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2022-10-16 17:01:12,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 17:01:12,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302998957] [2022-10-16 17:01:12,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302998957] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 17:01:12,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633137947] [2022-10-16 17:01:12,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 17:01:12,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 17:01:12,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 17:01:12,016 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) [2022-10-16 17:01:12,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-10-16 17:01:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 17:01:12,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 17:01:12,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 17:01:12,372 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-10-16 17:01:12,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 17:01:12,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633137947] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 17:01:12,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 17:01:12,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-10-16 17:01:12,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197781859] [2022-10-16 17:01:12,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 17:01:12,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 17:01:12,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 17:01:12,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 17:01:12,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:01:12,374 INFO L87 Difference]: Start difference. First operand 16405 states and 18903 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-10-16 17:01:12,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 17:01:12,819 INFO L93 Difference]: Finished difference Result 17537 states and 20259 transitions. [2022-10-16 17:01:12,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 17:01:12,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 325 [2022-10-16 17:01:12,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 17:01:12,826 INFO L225 Difference]: With dead ends: 17537 [2022-10-16 17:01:12,826 INFO L226 Difference]: Without dead ends: 0 [2022-10-16 17:01:12,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-10-16 17:01:12,849 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 17:01:12,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 124 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 17:01:12,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-16 17:01:12,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-16 17:01:12,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 17:01:12,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-16 17:01:12,851 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 325 [2022-10-16 17:01:12,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 17:01:12,852 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-16 17:01:12,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-10-16 17:01:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-16 17:01:12,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-16 17:01:12,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-10-16 17:01:12,856 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-10-16 17:01:12,856 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-10-16 17:01:12,856 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-10-16 17:01:12,856 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-10-16 17:01:12,857 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-10-16 17:01:12,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-10-16 17:01:13,071 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,SelfDestructingSolverStorable21 [2022-10-16 17:01:13,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-16 17:02:50,564 INFO L895 garLoopResultBuilder]: At program point L385(line 385) the Hoare annotation is: (let ((.cse18 (= |old(~p_dw_st~0)| 0)) (.cse23 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse19 (= ~p_dw_pc~0 1))) (let ((.cse21 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~q_free~0 0))) (.cse3 (not .cse19)) (.cse9 (not (= ~fast_clk_edge~0 1))) (.cse17 (not (= |old(~c_dr_st~0)| 0))) (.cse1 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse23)) (.cse20 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse0 (not (= ~q_req_up~0 0))) (.cse11 (not (= ~q_req_up~0 ~p_dw_pc~0))) (.cse22 (not (<= 2 ~fast_clk_edge~0))) (.cse12 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse13 (and .cse23 (= ~p_dw_st~0 0))) (.cse4 (not (= ~c_dr_pc~0 1))) (.cse14 (not (<= ~c_num_read~0 0))) (.cse5 (not (<= 0 ~c_num_read~0))) (.cse15 (not (<= ~p_num_write~0 0))) (.cse6 (not (<= 0 ~p_num_write~0))) (.cse16 (not .cse18)) (.cse7 (not (= ~q_read_ev~0 2))) (.cse8 (not (<= 0 ~t~0))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse12 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse18 .cse1 .cse12 .cse19 .cse20 .cse7 .cse8 .cse10) (or .cse21 .cse0 .cse17 .cse18 .cse1 .cse2 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse12 .cse3 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse22 .cse12 .cse3 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse10) (or .cse21 .cse0 .cse17 .cse18 .cse22 .cse1 .cse2 .cse14 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse18 .cse1 .cse19 (not (<= ~q_free~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse18 .cse1 .cse19 .cse4 .cse7 .cse8 .cse10) (or .cse21 .cse0 .cse17 .cse22 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse18 .cse1 .cse12 .cse4 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse22 .cse12 .cse3 .cse20 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse10) (or .cse0 .cse18 .cse22 .cse1 .cse12 .cse4 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse22 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse21 .cse0 .cse17 .cse2 .cse3 .cse13 .cse14 .cse5 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse11 .cse22 .cse12 .cse20 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse10) (or .cse0 .cse17 .cse1 .cse12 .cse3 .cse20 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse11 .cse12 .cse20 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse18 .cse22 .cse1 .cse12 .cse20 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse11 .cse22 .cse12 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse10)))) [2022-10-16 17:02:50,565 INFO L895 garLoopResultBuilder]: At program point L387-2(lines 387 391) the Hoare annotation is: (let ((.cse24 (= ~p_dw_pc~0 1))) (let ((.cse23 (= |old(~p_dw_st~0)| 0)) (.cse31 (= ~p_dw_st~0 0)) (.cse27 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse30 (= ~c_dr_pc~0 1)) (.cse34 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse32 (< 0 (+ activate_threads_~tmp~1 1))) (.cse28 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse29 (= ~q_req_up~0 0)) (.cse3 (not .cse24)) (.cse33 (<= activate_threads_~tmp~1 0))) (let ((.cse25 (and .cse34 .cse32 .cse28 .cse29 .cse3 .cse33)) (.cse21 (and .cse34 .cse27 .cse28 .cse29 .cse30 .cse24)) (.cse26 (and .cse34 .cse32 .cse28 .cse33)) (.cse16 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse20 (not (<= 2 ~fast_clk_edge~0))) (.cse22 (not (<= ~c_dr_pc~0 0))) (.cse12 (not (= |old(~c_dr_st~0)| 0))) (.cse1 (and .cse34 .cse28)) (.cse2 (not (= ~q_free~0 0))) (.cse4 (and .cse28 .cse31)) (.cse0 (not .cse29)) (.cse13 (not (= ~q_req_up~0 ~p_dw_pc~0))) (.cse14 (not .cse27)) (.cse15 (and .cse32 .cse28 .cse31 .cse33)) (.cse5 (not .cse30)) (.cse17 (not (<= ~c_num_read~0 0))) (.cse6 (not (<= 0 ~c_num_read~0))) (.cse18 (not (<= ~p_num_write~0 0))) (.cse7 (not (<= 0 ~p_num_write~0))) (.cse19 (not .cse23)) (.cse8 (not (= ~q_read_ev~0 2))) (.cse9 (not (<= 0 ~t~0))) (.cse10 (not (= ~fast_clk_edge~0 1))) (.cse11 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse6 .cse18 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse20 .cse21 .cse14 .cse3 .cse5 .cse17 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11) (or .cse22 .cse0 .cse12 .cse23 .cse20 .cse2 .cse24 .cse17 .cse6 .cse7 .cse25 .cse8 .cse9 .cse11) (or .cse0 .cse13 .cse20 .cse14 .cse15 .cse5 .cse17 .cse6 .cse18 .cse7 .cse19 .cse8 .cse9 .cse11) (or .cse22 .cse0 .cse12 .cse23 .cse2 .cse24 .cse17 .cse6 .cse7 .cse25 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse12 .cse1 .cse14 .cse3 .cse16 .cse4 .cse17 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse26 .cse23 .cse24 .cse5 .cse8 .cse9 .cse11) (or .cse0 .cse21 .cse14 .cse3 (and .cse27 .cse28 .cse29 .cse30 .cse24 .cse31) .cse5 .cse17 .cse6 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse22 .cse0 .cse12 .cse20 .cse1 .cse2 .cse3 .cse17 .cse6 .cse7 .cse8 .cse9 .cse11) (or .cse26 .cse23 .cse24 (not (<= ~q_free~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11) (or .cse0 .cse12 .cse26 .cse23 .cse14 .cse24 .cse16 .cse8 .cse9 .cse11) (or .cse0 .cse12 .cse20 .cse1 .cse14 .cse3 .cse16 .cse17 .cse6 .cse18 .cse7 .cse8 .cse9 .cse11) (or .cse0 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16 .cse17 .cse6 .cse18 .cse7 .cse19 .cse8 .cse9 .cse11) (or .cse0 .cse20 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11) (or .cse22 .cse0 .cse12 .cse1 .cse2 .cse3 .cse4 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse13 .cse14 .cse15 .cse5 .cse17 .cse6 .cse18 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11))))) [2022-10-16 17:02:50,565 INFO L899 garLoopResultBuilder]: For program point L385-1(line 385) no Hoare annotation was computed. [2022-10-16 17:02:50,566 INFO L895 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 379 403) the Hoare annotation is: (let ((.cse18 (= |old(~p_dw_st~0)| 0)) (.cse23 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse19 (= ~p_dw_pc~0 1))) (let ((.cse21 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~q_free~0 0))) (.cse3 (not .cse19)) (.cse9 (not (= ~fast_clk_edge~0 1))) (.cse17 (not (= |old(~c_dr_st~0)| 0))) (.cse1 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse23)) (.cse20 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse0 (not (= ~q_req_up~0 0))) (.cse11 (not (= ~q_req_up~0 ~p_dw_pc~0))) (.cse22 (not (<= 2 ~fast_clk_edge~0))) (.cse12 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse13 (and .cse23 (= ~p_dw_st~0 0))) (.cse4 (not (= ~c_dr_pc~0 1))) (.cse14 (not (<= ~c_num_read~0 0))) (.cse5 (not (<= 0 ~c_num_read~0))) (.cse15 (not (<= ~p_num_write~0 0))) (.cse6 (not (<= 0 ~p_num_write~0))) (.cse16 (not .cse18)) (.cse7 (not (= ~q_read_ev~0 2))) (.cse8 (not (<= 0 ~t~0))) (.cse10 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse12 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse18 .cse1 .cse12 .cse19 .cse20 .cse7 .cse8 .cse10) (or .cse21 .cse0 .cse17 .cse18 .cse1 .cse2 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse12 .cse3 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse22 .cse12 .cse3 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse10) (or .cse21 .cse0 .cse17 .cse18 .cse22 .cse1 .cse2 .cse14 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse18 .cse1 .cse19 (not (<= ~q_free~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse18 .cse1 .cse19 .cse4 .cse7 .cse8 .cse10) (or .cse21 .cse0 .cse17 .cse22 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse18 .cse1 .cse12 .cse4 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse22 .cse12 .cse3 .cse20 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse10) (or .cse0 .cse18 .cse22 .cse1 .cse12 .cse4 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse22 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse21 .cse0 .cse17 .cse2 .cse3 .cse13 .cse14 .cse5 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse11 .cse22 .cse12 .cse20 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse10) (or .cse0 .cse17 .cse1 .cse12 .cse3 .cse20 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse11 .cse12 .cse20 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse17 .cse18 .cse22 .cse1 .cse12 .cse20 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8 .cse10) (or .cse0 .cse11 .cse22 .cse12 .cse13 .cse4 .cse14 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse10)))) [2022-10-16 17:02:50,566 INFO L899 garLoopResultBuilder]: For program point L395(lines 395 399) no Hoare annotation was computed. [2022-10-16 17:02:50,566 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 379 403) no Hoare annotation was computed. [2022-10-16 17:02:50,567 INFO L899 garLoopResultBuilder]: For program point L393(line 393) no Hoare annotation was computed. [2022-10-16 17:02:50,567 INFO L899 garLoopResultBuilder]: For program point L395-2(lines 379 403) no Hoare annotation was computed. [2022-10-16 17:02:50,567 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2022-10-16 17:02:50,567 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 287 306) no Hoare annotation was computed. [2022-10-16 17:02:50,567 INFO L902 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 287 306) the Hoare annotation is: true [2022-10-16 17:02:50,567 INFO L902 garLoopResultBuilder]: At program point L303(lines 290 305) the Hoare annotation is: true [2022-10-16 17:02:50,567 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 300) no Hoare annotation was computed. [2022-10-16 17:02:50,567 INFO L899 garLoopResultBuilder]: For program point L291(lines 291 301) no Hoare annotation was computed. [2022-10-16 17:02:50,568 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 287 306) no Hoare annotation was computed. [2022-10-16 17:02:50,568 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 101) no Hoare annotation was computed. [2022-10-16 17:02:50,568 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 104) no Hoare annotation was computed. [2022-10-16 17:02:50,568 INFO L899 garLoopResultBuilder]: For program point L95-2(lines 94 118) no Hoare annotation was computed. [2022-10-16 17:02:50,568 INFO L902 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 91 119) the Hoare annotation is: true [2022-10-16 17:02:50,569 INFO L895 garLoopResultBuilder]: At program point L116(lines 94 118) the Hoare annotation is: (let ((.cse14 (= ~p_dw_pc~0 1)) (.cse15 (= ~p_dw_st~0 0))) (let ((.cse20 (not .cse15)) (.cse21 (not (= ~q_req_up~0 ~p_dw_pc~0))) (.cse18 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse17 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse19 (not (<= ~p_num_write~0 0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse22 (not (<= 2 ~fast_clk_edge~0))) (.cse2 (not (= ~c_dr_st~0 0))) (.cse5 (not (<= ~c_num_read~0 0))) (.cse1 (not (= ~q_req_up~0 0))) (.cse3 (not (= ~q_free~0 0))) (.cse13 (not (<= 2 ~slow_clk_edge~0))) (.cse4 (not .cse14)) (.cse16 (not (= ~c_dr_pc~0 1))) (.cse6 (and (<= is_do_read_c_triggered_~__retres1~1 0) (<= 0 is_do_read_c_triggered_~__retres1~1))) (.cse7 (not (<= 0 ~c_num_read~0))) (.cse8 (not (<= 0 ~p_num_write~0))) (.cse9 (not (= ~q_read_ev~0 2))) (.cse10 (not (<= 0 ~t~0))) (.cse11 (not (= ~fast_clk_edge~0 1))) (.cse12 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse13 .cse14 (not (<= ~q_free~0 0)) .cse15 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (or .cse1 .cse2 .cse17 .cse4 .cse18 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 .cse20 .cse21 .cse17 .cse13 .cse16 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 .cse2 .cse17 .cse14 .cse18 .cse15 .cse6 .cse9 .cse10 .cse12) (or .cse0 .cse1 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (or .cse1 .cse21 .cse22 .cse2 .cse17 .cse18 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse12) (or .cse1 .cse20 .cse21 .cse22 .cse17 .cse13 .cse16 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse12) (or .cse1 .cse21 .cse2 .cse17 .cse18 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 .cse17 .cse13 .cse4 .cse16 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse1 .cse22 .cse2 .cse17 .cse4 .cse18 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse12) (or .cse1 .cse22 .cse3 .cse13 .cse4 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (or .cse1 .cse22 .cse17 .cse13 .cse4 .cse16 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse22 .cse2 .cse3 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12) (or .cse1 .cse3 .cse13 .cse4 .cse16 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12)))) [2022-10-16 17:02:50,569 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 91 119) no Hoare annotation was computed. [2022-10-16 17:02:50,569 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 111) no Hoare annotation was computed. [2022-10-16 17:02:50,569 INFO L899 garLoopResultBuilder]: For program point L105-1(lines 105 114) no Hoare annotation was computed. [2022-10-16 17:02:50,569 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 91 119) no Hoare annotation was computed. [2022-10-16 17:02:50,570 INFO L895 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 307 324) the Hoare annotation is: (let ((.cse3 (= ~p_dw_pc~0 1))) (let ((.cse10 (not (<= ~c_dr_pc~0 0))) (.cse12 (not (= ~q_free~0 0))) (.cse18 (not (= ~q_req_up~0 ~p_dw_pc~0))) (.cse2 (not (= ~c_dr_st~0 0))) (.cse4 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse0 (not (= ~q_req_up~0 0))) (.cse11 (not (<= 2 ~fast_clk_edge~0))) (.cse1 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse13 (not .cse3)) (.cse14 (not (<= ~c_num_read~0 0))) (.cse17 (not (<= ~p_num_write~0 0))) (.cse5 (= ~p_dw_st~0 0)) (.cse6 (not (= |old(~q_read_ev~0)| 2))) (.cse19 (not (= ~c_dr_pc~0 1))) (.cse15 (not (<= 0 ~c_num_read~0))) (.cse16 (not (<= 0 ~p_num_write~0))) (.cse7 (not (<= 0 ~t~0))) (.cse8 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~q_read_ev~0 2))) (.cse9 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse11 .cse2 .cse12 .cse13 .cse6 .cse14 .cse15 .cse16 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse11 .cse2 .cse12 .cse5 .cse6 .cse14 .cse15 .cse16 .cse7 .cse8 .cse9) (or .cse0 .cse11 .cse1 .cse2 .cse13 .cse4 .cse6 .cse14 .cse15 .cse17 .cse16 .cse7 .cse8 .cse9) (or .cse0 .cse18 .cse11 .cse1 .cse6 .cse19 .cse14 .cse15 .cse17 .cse16 .cse7 .cse8 .cse9) (or .cse0 .cse3 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9) (or .cse0 .cse11 .cse12 .cse13 .cse6 .cse19 .cse15 .cse16 .cse7 .cse8 .cse9) (or .cse0 .cse18 .cse11 .cse1 .cse2 .cse4 .cse6 .cse14 .cse15 .cse17 .cse16 .cse7 .cse8 .cse9) (or .cse0 .cse11 .cse1 .cse13 .cse6 .cse19 .cse14 .cse15 .cse17 .cse16 .cse7 .cse8 .cse9) (or .cse3 (not (<= ~q_free~0 0)) .cse5 .cse6 .cse19 .cse15 .cse16 .cse7 .cse8 .cse9)))) [2022-10-16 17:02:50,570 INFO L899 garLoopResultBuilder]: For program point L316-1(lines 307 324) no Hoare annotation was computed. [2022-10-16 17:02:50,570 INFO L899 garLoopResultBuilder]: For program point L311-1(lines 310 323) no Hoare annotation was computed. [2022-10-16 17:02:50,570 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 307 324) no Hoare annotation was computed. [2022-10-16 17:02:50,571 INFO L899 garLoopResultBuilder]: For program point L258-1(lines 254 268) no Hoare annotation was computed. [2022-10-16 17:02:50,571 INFO L895 garLoopResultBuilder]: At program point L49(lines 32 51) the Hoare annotation is: (let ((.cse19 (= ~p_dw_pc~0 1))) (let ((.cse14 (not (= ~p_dw_pc~0 |old(~q_req_up~0)|))) (.cse15 (not (<= ~p_num_write~0 0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse6 (not (<= ~c_num_read~0 0))) (.cse16 (not .cse19)) (.cse1 (not (<= 2 ~fast_clk_edge~0))) (.cse3 (not (= ~q_free~0 0))) (.cse18 (not (= ~c_dr_pc~0 1))) (.cse7 (not (<= 0 ~c_num_read~0))) (.cse8 (not (<= 0 ~p_num_write~0))) (.cse17 (and (= ~q_req_up~0 0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_read_ev~0 2))) (.cse12 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse2 (not (= ~c_dr_st~0 0))) (.cse13 (not (= ~c_dr_pc~0 |old(~q_req_up~0)|))) (.cse4 (= ~p_dw_st~0 0)) (.cse5 (not (= |old(~q_read_ev~0)| 2))) (.cse9 (not (= |old(~q_req_up~0)| 0))) (.cse10 (not (<= 0 ~t~0))) (.cse11 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse12 .cse2 .cse13 .cse5 .cse14 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse12 .cse2 .cse3 .cse16 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse17 .cse10 .cse11) (or .cse1 .cse12 .cse2 .cse16 .cse13 .cse5 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse12 .cse16 .cse5 .cse18 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse12 .cse5 .cse18 .cse14 .cse6 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11) (or .cse19 (not (<= ~q_free~0 0)) .cse4 .cse5 .cse18 .cse7 .cse8 .cse17 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse19 .cse4 .cse5 .cse18 .cse9 .cse10 .cse11) (or .cse1 .cse3 .cse16 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse3 .cse13 .cse4 .cse5 .cse18 .cse7 .cse8 .cse17 .cse10 .cse11) (or .cse12 .cse2 .cse19 .cse13 .cse4 .cse5 .cse9 .cse10 .cse11)))) [2022-10-16 17:02:50,572 INFO L895 garLoopResultBuilder]: At program point update_channelsENTRY(lines 254 268) the Hoare annotation is: (let ((.cse1 (= ~p_dw_pc~0 1)) (.cse22 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse23 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse24 (= ~q_read_ev~0 2))) (let ((.cse8 (not (<= ~c_dr_pc~0 0))) (.cse9 (and .cse22 .cse23 .cse24 (= ~q_req_up~0 ~p_dw_pc~0))) (.cse15 (not (= ~p_dw_pc~0 |old(~q_req_up~0)|))) (.cse0 (and .cse22 .cse23 (= ~q_req_up~0 |old(~q_req_up~0)|) .cse24)) (.cse13 (not (= ~q_free~0 0))) (.cse2 (= ~p_dw_st~0 0)) (.cse4 (not (= ~c_dr_pc~0 1))) (.cse10 (not (<= 2 ~fast_clk_edge~0))) (.cse11 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse20 (and .cse22 .cse23 .cse24 (= ~c_dr_pc~0 ~q_req_up~0))) (.cse12 (not (= ~c_dr_st~0 0))) (.cse14 (not .cse1)) (.cse21 (not (= ~c_dr_pc~0 |old(~q_req_up~0)|))) (.cse3 (not (= |old(~q_read_ev~0)| 2))) (.cse16 (not (<= ~c_num_read~0 0))) (.cse17 (not (<= 0 ~c_num_read~0))) (.cse19 (not (<= ~p_num_write~0 0))) (.cse18 (not (<= 0 ~p_num_write~0))) (.cse5 (not (= |old(~q_req_up~0)| 0))) (.cse6 (not (<= 0 ~t~0))) (.cse7 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse3 .cse15 .cse16 .cse17 .cse18 .cse6 .cse7) (or .cse10 .cse0 .cse11 .cse14 .cse3 .cse4 .cse16 .cse17 .cse19 .cse18 .cse5 .cse6 .cse7) (or .cse0 .cse1 (not (<= ~q_free~0 0)) .cse2 .cse3 .cse4 .cse17 .cse18 .cse6 .cse7) (or .cse8 .cse10 .cse0 .cse12 .cse13 .cse14 .cse3 .cse16 .cse17 .cse18 .cse5 .cse6 .cse7) (or .cse8 .cse10 .cse0 .cse12 .cse13 .cse2 .cse3 .cse16 .cse17 .cse18 .cse5 .cse6 .cse7) (or .cse9 .cse10 .cse11 .cse3 .cse4 .cse15 .cse16 .cse17 .cse19 .cse18 .cse5 .cse6 .cse7) (or .cse11 .cse20 .cse12 .cse1 .cse21 .cse2 .cse3 .cse5 .cse6 .cse7) (or .cse10 .cse11 .cse20 .cse12 .cse21 .cse3 .cse15 .cse16 .cse17 .cse19 .cse18 .cse5 .cse6 .cse7) (or .cse10 .cse0 .cse13 .cse14 .cse3 .cse4 .cse17 .cse18 .cse5 .cse6 .cse7) (or .cse10 .cse20 .cse13 .cse21 .cse2 .cse3 .cse4 .cse17 .cse18 .cse6 .cse7) (or .cse10 .cse11 .cse20 .cse12 .cse14 .cse21 .cse3 .cse16 .cse17 .cse19 .cse18 .cse5 .cse6 .cse7)))) [2022-10-16 17:02:50,572 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 254 268) no Hoare annotation was computed. [2022-10-16 17:02:50,572 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 41 45) no Hoare annotation was computed. [2022-10-16 17:02:50,572 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2022-10-16 17:02:50,572 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 35 50) no Hoare annotation was computed. [2022-10-16 17:02:50,572 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 325 342) no Hoare annotation was computed. [2022-10-16 17:02:50,573 INFO L899 garLoopResultBuilder]: For program point L334-1(lines 325 342) no Hoare annotation was computed. [2022-10-16 17:02:50,573 INFO L899 garLoopResultBuilder]: For program point L329-1(lines 328 341) no Hoare annotation was computed. [2022-10-16 17:02:50,573 INFO L895 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 325 342) the Hoare annotation is: (let ((.cse3 (= ~p_dw_pc~0 1))) (let ((.cse10 (not (<= ~c_dr_pc~0 0))) (.cse12 (not (= ~q_free~0 0))) (.cse18 (not (= ~q_req_up~0 ~p_dw_pc~0))) (.cse2 (not (= ~c_dr_st~0 0))) (.cse4 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse0 (not (= ~q_req_up~0 0))) (.cse11 (not (<= 2 ~fast_clk_edge~0))) (.cse1 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) (.cse13 (not .cse3)) (.cse14 (not (<= ~c_num_read~0 0))) (.cse17 (not (<= ~p_num_write~0 0))) (.cse5 (= ~p_dw_st~0 0)) (.cse6 (not (= |old(~q_read_ev~0)| 2))) (.cse19 (not (= ~c_dr_pc~0 1))) (.cse15 (not (<= 0 ~c_num_read~0))) (.cse16 (not (<= 0 ~p_num_write~0))) (.cse7 (not (<= 0 ~t~0))) (.cse8 (and (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~q_read_ev~0 2))) (.cse9 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse11 .cse2 .cse12 .cse13 .cse6 .cse14 .cse15 .cse16 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse11 .cse2 .cse12 .cse5 .cse6 .cse14 .cse15 .cse16 .cse7 .cse8 .cse9) (or .cse0 .cse11 .cse1 .cse2 .cse13 .cse4 .cse6 .cse14 .cse15 .cse17 .cse16 .cse7 .cse8 .cse9) (or .cse0 .cse18 .cse11 .cse1 .cse6 .cse19 .cse14 .cse15 .cse17 .cse16 .cse7 .cse8 .cse9) (or .cse0 .cse3 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9) (or .cse0 .cse11 .cse12 .cse13 .cse6 .cse19 .cse15 .cse16 .cse7 .cse8 .cse9) (or .cse0 .cse18 .cse11 .cse1 .cse2 .cse4 .cse6 .cse14 .cse15 .cse17 .cse16 .cse7 .cse8 .cse9) (or .cse0 .cse11 .cse1 .cse13 .cse6 .cse19 .cse14 .cse15 .cse17 .cse16 .cse7 .cse8 .cse9) (or .cse3 (not (<= ~q_free~0 0)) .cse5 .cse6 .cse19 .cse15 .cse16 .cse7 .cse8 .cse9)))) [2022-10-16 17:02:50,573 INFO L899 garLoopResultBuilder]: For program point L514-1(line 514) no Hoare annotation was computed. [2022-10-16 17:02:50,573 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2022-10-16 17:02:50,574 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 231) no Hoare annotation was computed. [2022-10-16 17:02:50,574 INFO L899 garLoopResultBuilder]: For program point L415-1(lines 410 450) no Hoare annotation was computed. [2022-10-16 17:02:50,574 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 356) no Hoare annotation was computed. [2022-10-16 17:02:50,574 INFO L895 garLoopResultBuilder]: At program point L349-2(lines 345 360) the Hoare annotation is: (let ((.cse8 (= ~p_dw_pc~0 1))) (let ((.cse1 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse15 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse14 (not .cse8)) (.cse13 (not (= ~p_dw_st~0 0))) (.cse12 (= ~c_dr_st~0 0)) (.cse0 (<= 0 ~t~0)) (.cse2 (<= ~c_num_read~0 0)) (.cse4 (<= 0 ~p_num_write~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse17 (= ~q_free~0 0)) (.cse6 (= ~q_req_up~0 0)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~fast_clk_edge~0 1)) (.cse18 (<= ~c_dr_pc~0 0)) (.cse11 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse13 .cse3 .cse5 .cse6 .cse14 .cse9 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse16 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse15 .cse11) (and .cse0 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse16 .cse15 .cse11) (and .cse0 .cse13 .cse5 .cse6 .cse7 .cse14 .cse9) (and .cse0 .cse13 .cse4 .cse5 .cse7 .cse14 .cse9 (<= ~q_free~0 0) .cse11) (and .cse12 .cse0 .cse13 .cse2 .cse4 .cse5 .cse17 .cse6 .cse9 .cse10 .cse18 .cse11) (and .cse12 .cse0 .cse2 .cse4 .cse5 .cse17 .cse6 .cse8 .cse9 .cse10 .cse18 .cse11)))) [2022-10-16 17:02:50,575 INFO L899 garLoopResultBuilder]: For program point L465(lines 465 470) no Hoare annotation was computed. [2022-10-16 17:02:50,575 INFO L899 garLoopResultBuilder]: For program point L234(lines 234 246) no Hoare annotation was computed. [2022-10-16 17:02:50,575 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-16 17:02:50,575 INFO L899 garLoopResultBuilder]: For program point L218-1(lines 218 228) no Hoare annotation was computed. [2022-10-16 17:02:50,575 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 160) no Hoare annotation was computed. [2022-10-16 17:02:50,576 INFO L895 garLoopResultBuilder]: At program point L499(line 499) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse11 .cse4 .cse16 .cse13 .cse7 .cse14 .cse17 .cse18 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse2 .cse11 .cse4 .cse16 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-10-16 17:02:50,576 INFO L899 garLoopResultBuilder]: For program point L499-1(line 499) no Hoare annotation was computed. [2022-10-16 17:02:50,576 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 241) no Hoare annotation was computed. [2022-10-16 17:02:50,576 INFO L899 garLoopResultBuilder]: For program point L202(lines 202 206) no Hoare annotation was computed. [2022-10-16 17:02:50,576 INFO L899 garLoopResultBuilder]: For program point L351(line 351) no Hoare annotation was computed. [2022-10-16 17:02:50,576 INFO L899 garLoopResultBuilder]: For program point L351-1(line 351) no Hoare annotation was computed. [2022-10-16 17:02:50,577 INFO L895 garLoopResultBuilder]: At program point L153(lines 148 192) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse12 (<= ~p_num_write~0 0)) (.cse3 (<= ~c_num_read~0 0)) (.cse13 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse7 (= ~q_req_up~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse4 (<= 0 ~p_num_write~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~q_free~0 0)) (.cse14 (= ~c_dr_pc~0 1)) (.cse8 (= ~p_dw_pc~0 1)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (<= 2 ~fast_clk_edge~0)) (.cse11 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 0) .cse11) (and .cse1 .cse12 .cse2 .cse3 .cse13 .cse4 .cse5 .cse7 .cse14 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse13 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 (= ~c_dr_pc~0 ~q_req_up~0) .cse11) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse14 .cse8 .cse9 .cse10 .cse11))) [2022-10-16 17:02:50,577 INFO L895 garLoopResultBuilder]: At program point L203(lines 198 252) the Hoare annotation is: false [2022-10-16 17:02:50,577 INFO L895 garLoopResultBuilder]: At program point L484(line 484) the Hoare annotation is: (and (= ~c_dr_st~0 0) (<= 0 ~t~0) (<= ~p_num_write~0 0) (<= ~c_num_read~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (<= ~t~0 0) (<= 2 ~slow_clk_edge~0) (= ~q_read_ev~0 2) (<= 2 ~fast_clk_edge~0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~c_dr_pc~0 ~q_req_up~0) (<= 0 ~c_num_read~0)) [2022-10-16 17:02:50,577 INFO L899 garLoopResultBuilder]: For program point L484-1(line 484) no Hoare annotation was computed. [2022-10-16 17:02:50,578 INFO L895 garLoopResultBuilder]: At program point L451(lines 404 456) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse11 .cse4 .cse16 .cse13 .cse7 .cse14 .cse17 .cse18 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse2 .cse11 .cse4 .cse16 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-10-16 17:02:50,578 INFO L895 garLoopResultBuilder]: At program point L435(lines 410 450) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse11 .cse4 .cse16 .cse13 .cse7 .cse14 .cse17 .cse18 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse1 .cse2 .cse11 .cse4 .cse16 .cse13 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-10-16 17:02:50,578 INFO L895 garLoopResultBuilder]: At program point L171(lines 148 192) the Hoare annotation is: (let ((.cse0 (<= 0 ~t~0)) (.cse1 (<= ~p_num_write~0 0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse3 (<= ~c_num_read~0 0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (<= 0 ~p_num_write~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~q_read_ev~0 2)) (.cse8 (<= 2 ~fast_clk_edge~0)) (.cse9 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~c_dr_pc~0 1) .cse7 .cse8 .cse9) (and (= ~c_dr_st~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~p_dw_pc~0 1) .cse7 .cse8 (<= ~c_dr_pc~0 0) .cse9))) [2022-10-16 17:02:50,579 INFO L895 garLoopResultBuilder]: At program point L551(lines 535 553) the Hoare annotation is: (and (= ~c_dr_st~0 0) (<= 0 ~t~0) (<= ~p_num_write~0 0) (<= ~c_num_read~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (<= ~t~0 0) (<= 2 ~slow_clk_edge~0) (= ~q_read_ev~0 2) (<= 2 ~fast_clk_edge~0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~c_dr_pc~0 ~q_req_up~0) (<= 0 ~c_num_read~0)) [2022-10-16 17:02:50,579 INFO L895 garLoopResultBuilder]: At program point L188(lines 145 193) the Hoare annotation is: (let ((.cse17 (= ~p_dw_pc~0 1))) (let ((.cse15 (<= ~p_num_write~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse9 (<= ~c_num_read~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse16 (= ~c_dr_pc~0 1)) (.cse6 (not .cse17)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse11 (= ~q_free~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse12 (<= 2 ~fast_clk_edge~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse14 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse9 .cse10 .cse4 .cse11 .cse5 .cse6 .cse7 .cse12 .cse13 .cse14) (and .cse1 .cse15 .cse2 .cse9 .cse3 .cse10 .cse4 .cse5 .cse16 .cse7 .cse12 .cse14) (and .cse0 .cse1 .cse15 .cse2 .cse9 .cse3 .cse10 .cse4 .cse5 .cse7 .cse12 .cse8 .cse14) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse16 .cse7 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse9 .cse3 .cse10 .cse4 .cse11 .cse17 .cse7 .cse12 .cse13 .cse18 .cse14) (and .cse1 .cse2 .cse4 .cse5 .cse16 .cse6 .cse7) (and .cse1 .cse2 .cse10 .cse4 .cse16 .cse6 .cse7 (<= ~q_free~0 0) .cse14) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse17 .cse7 .cse12 .cse18 .cse8 .cse14)))) [2022-10-16 17:02:50,579 INFO L899 garLoopResultBuilder]: For program point L155(lines 155 159) no Hoare annotation was computed. [2022-10-16 17:02:50,580 INFO L895 garLoopResultBuilder]: At program point L370-1(lines 361 378) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-10-16 17:02:50,580 INFO L895 garLoopResultBuilder]: At program point L486(line 486) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse4 (= ~q_req_up~0 0)) (.cse5 (<= ~t~0 0)) (.cse6 (= ~q_read_ev~0 2)) (.cse7 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 .cse1 (<= ~p_num_write~0 0) (<= ~c_num_read~0 0) .cse2 (<= 0 ~p_num_write~0) .cse3 .cse4 .cse5 (<= 2 ~slow_clk_edge~0) .cse6 (<= 2 ~fast_clk_edge~0) .cse7 .cse8 (<= 0 ~c_num_read~0)) (and .cse0 .cse1 (not (= ~p_dw_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-10-16 17:02:50,580 INFO L895 garLoopResultBuilder]: At program point L486-1(line 486) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse4 (= ~q_req_up~0 0)) (.cse5 (<= ~t~0 0)) (.cse6 (= ~q_read_ev~0 2)) (.cse7 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 .cse1 (<= ~p_num_write~0 0) (<= ~c_num_read~0 0) .cse2 (<= 0 ~p_num_write~0) .cse3 .cse4 .cse5 (<= 2 ~slow_clk_edge~0) .cse6 (<= 2 ~fast_clk_edge~0) .cse7 .cse8 (<= 0 ~c_num_read~0)) (and .cse0 .cse1 (not (= ~p_dw_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-10-16 17:02:50,580 INFO L899 garLoopResultBuilder]: For program point L420(lines 410 450) no Hoare annotation was computed. [2022-10-16 17:02:50,581 INFO L895 garLoopResultBuilder]: At program point L503(line 503) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-10-16 17:02:50,581 INFO L895 garLoopResultBuilder]: At program point L503-1(line 503) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-10-16 17:02:50,581 INFO L902 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: true [2022-10-16 17:02:50,582 INFO L895 garLoopResultBuilder]: At program point L487(line 487) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse4 (= ~q_req_up~0 0)) (.cse5 (<= ~t~0 0)) (.cse6 (= ~q_read_ev~0 2)) (.cse7 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 .cse1 (<= ~p_num_write~0 0) (<= ~c_num_read~0 0) .cse2 (<= 0 ~p_num_write~0) .cse3 .cse4 .cse5 (<= 2 ~slow_clk_edge~0) .cse6 (<= 2 ~fast_clk_edge~0) .cse7 .cse8 (<= 0 ~c_num_read~0)) (and .cse0 .cse1 (not (= ~p_dw_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-10-16 17:02:50,582 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-16 17:02:50,582 INFO L895 garLoopResultBuilder]: At program point L504(line 504) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-10-16 17:02:50,582 INFO L899 garLoopResultBuilder]: For program point L273(lines 273 277) no Hoare annotation was computed. [2022-10-16 17:02:50,582 INFO L899 garLoopResultBuilder]: For program point L273-2(lines 272 285) no Hoare annotation was computed. [2022-10-16 17:02:50,583 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 231) no Hoare annotation was computed. [2022-10-16 17:02:50,583 INFO L895 garLoopResultBuilder]: At program point L505(line 505) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-10-16 17:02:50,584 INFO L895 garLoopResultBuilder]: At program point L472(lines 461 474) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-10-16 17:02:50,584 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 446) no Hoare annotation was computed. [2022-10-16 17:02:50,584 INFO L895 garLoopResultBuilder]: At program point L473(lines 457 475) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-10-16 17:02:50,584 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2022-10-16 17:02:50,584 INFO L899 garLoopResultBuilder]: For program point L424(lines 424 431) no Hoare annotation was computed. [2022-10-16 17:02:50,584 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 183) no Hoare annotation was computed. [2022-10-16 17:02:50,585 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-16 17:02:50,585 INFO L895 garLoopResultBuilder]: At program point L491-1(lines 488 528) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-10-16 17:02:50,585 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 183) no Hoare annotation was computed. [2022-10-16 17:02:50,585 INFO L899 garLoopResultBuilder]: For program point L508(line 508) no Hoare annotation was computed. [2022-10-16 17:02:50,585 INFO L902 garLoopResultBuilder]: At program point L244(line 244) the Hoare annotation is: true [2022-10-16 17:02:50,586 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-10-16 17:02:50,586 INFO L895 garLoopResultBuilder]: At program point L244-1(lines 198 252) the Hoare annotation is: (let ((.cse14 (= ~p_dw_pc~0 1))) (let ((.cse9 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse1 (<= ~p_num_write~0 0)) (.cse2 (<= ~c_num_read~0 0)) (.cse6 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~q_free~0 0)) (.cse7 (= ~q_req_up~0 0)) (.cse5 (<= 2 ~fast_clk_edge~0)) (.cse0 (<= 0 ~t~0)) (.cse11 (not (= ~p_dw_st~0 0))) (.cse3 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse13 (not .cse14)) (.cse8 (= ~q_read_ev~0 2)) (.cse10 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or (and .cse6 .cse7 (= ~c_dr_pc~0 1) .cse8 .cse9) (and .cse6 .cse7 .cse8 .cse9 (= ~c_dr_pc~0 ~q_req_up~0))) .cse10) (and .cse0 .cse11 .cse3 .cse4 .cse12 .cse8 .cse5 .cse9 .cse10) (and .cse0 .cse11 .cse4 .cse7 .cse13 .cse8) (and .cse0 .cse1 .cse2 .cse6 .cse3 .cse4 .cse7 .cse14 .cse8 .cse5 .cse10) (and .cse0 .cse3 .cse4 .cse12 .cse7 .cse14 .cse8 .cse5 .cse10) (and .cse0 .cse11 .cse3 .cse4 .cse13 .cse8 (<= ~q_free~0 0) .cse10)))) [2022-10-16 17:02:50,586 INFO L899 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2022-10-16 17:02:50,586 INFO L895 garLoopResultBuilder]: At program point L278-1(lines 269 286) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse4 (= ~q_req_up~0 0)) (.cse5 (<= ~t~0 0)) (.cse6 (= ~q_read_ev~0 2)) (.cse7 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~q_req_up~0))) (or (and .cse0 .cse1 (<= ~p_num_write~0 0) (<= ~c_num_read~0 0) .cse2 (<= 0 ~p_num_write~0) .cse3 .cse4 .cse5 (<= 2 ~slow_clk_edge~0) .cse6 (<= 2 ~fast_clk_edge~0) .cse7 .cse8 (<= 0 ~c_num_read~0)) (and .cse0 .cse1 (not (= ~p_dw_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2022-10-16 17:02:50,587 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 519) no Hoare annotation was computed. [2022-10-16 17:02:50,587 INFO L899 garLoopResultBuilder]: For program point L510-2(lines 510 519) no Hoare annotation was computed. [2022-10-16 17:02:50,587 INFO L895 garLoopResultBuilder]: At program point L411(line 411) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse11 .cse4 .cse16 .cse13 .cse7 .cse14 .cse17 .cse18 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse1 .cse2 .cse11 .cse4 .cse16 .cse13 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-10-16 17:02:50,588 INFO L895 garLoopResultBuilder]: At program point L164-1(lines 148 192) the Hoare annotation is: (let ((.cse16 (= ~p_dw_pc~0 1))) (let ((.cse11 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse13 (<= ~p_num_write~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (not .cse16)) (.cse12 (= ~c_dr_st~0 0)) (.cse0 (<= 0 ~t~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse14 (<= ~c_num_read~0 0)) (.cse15 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse2 (<= 0 ~p_num_write~0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse4 (= ~q_free~0 0)) (.cse8 (= ~q_read_ev~0 2)) (.cse9 (<= 2 ~fast_clk_edge~0)) (.cse10 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse11 .cse10) (and .cse12 .cse0 .cse13 .cse1 .cse14 .cse15 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse11 .cse10) (and .cse0 .cse13 .cse1 .cse14 .cse15 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse12 .cse0 .cse1 .cse14 .cse15 .cse2 .cse3 .cse4 .cse16 .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~q_req_up~0 ~p_dw_pc~0) .cse10)))) [2022-10-16 17:02:50,588 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-16 17:02:50,588 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 351) no Hoare annotation was computed. [2022-10-16 17:02:50,588 INFO L899 garLoopResultBuilder]: For program point L231(line 231) no Hoare annotation was computed. [2022-10-16 17:02:50,588 INFO L899 garLoopResultBuilder]: For program point L231-1(line 231) no Hoare annotation was computed. [2022-10-16 17:02:50,588 INFO L899 garLoopResultBuilder]: For program point L165(line 165) no Hoare annotation was computed. [2022-10-16 17:02:50,588 INFO L899 garLoopResultBuilder]: For program point L413(line 413) no Hoare annotation was computed. [2022-10-16 17:02:50,588 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 351) no Hoare annotation was computed. [2022-10-16 17:02:50,589 INFO L895 garLoopResultBuilder]: At program point L248(lines 195 253) the Hoare annotation is: (let ((.cse8 (= ~p_dw_pc~0 1))) (let ((.cse13 (not .cse8)) (.cse1 (<= ~p_num_write~0 0)) (.cse2 (<= ~c_num_read~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_req_up~0 0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse0 (<= 0 ~t~0)) (.cse12 (not (= ~p_dw_st~0 0))) (.cse4 (<= 0 ~p_num_write~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse15 (= ~q_free~0 0)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (<= 2 ~fast_clk_edge~0)) (.cse14 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse11 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse5 .cse6 .cse7 .cse13 .cse9) (and .cse0 .cse12 .cse4 .cse5 .cse7 .cse13 .cse9 (<= ~q_free~0 0) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse14 .cse11) (and .cse0 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse4 .cse5 .cse15 .cse8 .cse9 .cse10 .cse14 (= ~c_dr_pc~0 ~q_req_up~0) .cse11)))) [2022-10-16 17:02:50,589 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 161) no Hoare annotation was computed. [2022-10-16 17:02:50,589 INFO L902 garLoopResultBuilder]: At program point L529(lines 476 534) the Hoare annotation is: true [2022-10-16 17:02:50,589 INFO L895 garLoopResultBuilder]: At program point L463(line 463) the Hoare annotation is: (let ((.cse13 (= ~p_dw_pc~0 1))) (let ((.cse8 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse6 (not .cse13)) (.cse9 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse18 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 0 ~t~0)) (.cse2 (not (= ~p_dw_st~0 0))) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 0 ~p_num_write~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse16 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse14 (<= 2 ~fast_clk_edge~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse10 .cse11 .cse4 .cse16 .cse5 .cse13 .cse7 .cse14 .cse17 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse7 .cse14 .cse18 .cse8 .cse15) (and .cse0 .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse13 .cse7 .cse14 .cse8 .cse15) (and .cse1 .cse2 .cse4 .cse5 .cse12 .cse6 .cse7) (and .cse1 .cse2 .cse11 .cse4 .cse12 .cse6 .cse7 (<= ~q_free~0 0) .cse15) (and .cse1 .cse9 .cse10 .cse3 .cse11 .cse4 .cse5 .cse12 .cse7 .cse14 .cse18 .cse15) (and .cse1 .cse11 .cse4 .cse16 .cse5 .cse12 .cse13 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse16 .cse5 .cse7 .cse14 .cse17 .cse15)))) [2022-10-16 17:02:50,590 INFO L899 garLoopResultBuilder]: For program point L463-1(line 463) no Hoare annotation was computed. [2022-10-16 17:02:50,590 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2022-10-16 17:02:50,590 INFO L899 garLoopResultBuilder]: For program point L183(line 183) no Hoare annotation was computed. [2022-10-16 17:02:50,590 INFO L899 garLoopResultBuilder]: For program point L183-1(line 183) no Hoare annotation was computed. [2022-10-16 17:02:50,590 INFO L902 garLoopResultBuilder]: At program point L563(lines 554 565) the Hoare annotation is: true [2022-10-16 17:02:50,590 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 369) no Hoare annotation was computed. [2022-10-16 17:02:50,590 INFO L899 garLoopResultBuilder]: For program point L365-2(lines 364 377) no Hoare annotation was computed. [2022-10-16 17:02:50,591 INFO L895 garLoopResultBuilder]: At program point L514(line 514) the Hoare annotation is: (let ((.cse8 (= ~p_dw_pc~0 1))) (let ((.cse1 (<= ~p_num_write~0 0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse15 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse14 (not .cse8)) (.cse13 (not (= ~p_dw_st~0 0))) (.cse12 (= ~c_dr_st~0 0)) (.cse0 (<= 0 ~t~0)) (.cse2 (<= ~c_num_read~0 0)) (.cse4 (<= 0 ~p_num_write~0)) (.cse5 (= 1 ~c_dr_i~0)) (.cse17 (= ~q_free~0 0)) (.cse6 (= ~q_req_up~0 0)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~fast_clk_edge~0 1)) (.cse18 (<= ~c_dr_pc~0 0)) (.cse11 (<= 0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse13 .cse3 .cse5 .cse6 .cse14 .cse9 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse16 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse15 .cse11) (and .cse0 .cse4 .cse5 .cse17 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse10 .cse16 .cse15 .cse11) (and .cse0 .cse13 .cse5 .cse6 .cse7 .cse14 .cse9) (and .cse0 .cse13 .cse4 .cse5 .cse7 .cse14 .cse9 (<= ~q_free~0 0) .cse11) (and .cse12 .cse0 .cse13 .cse2 .cse4 .cse5 .cse17 .cse6 .cse9 .cse10 .cse18 .cse11) (and .cse12 .cse0 .cse2 .cse4 .cse5 .cse17 .cse6 .cse8 .cse9 .cse10 .cse18 .cse11)))) [2022-10-16 17:02:50,591 INFO L899 garLoopResultBuilder]: For program point L66-2(lines 65 89) no Hoare annotation was computed. [2022-10-16 17:02:50,591 INFO L895 garLoopResultBuilder]: At program point L87(lines 65 89) the Hoare annotation is: (let ((.cse2 (= ~p_dw_pc~0 1))) (let ((.cse4 (not (= ~c_dr_pc~0 1))) (.cse8 (not (= ~q_req_up~0 ~p_dw_pc~0))) (.cse13 (not (<= ~p_num_write~0 0))) (.cse18 (not (= ~fast_clk_edge~0 1))) (.cse10 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse16 (not (= ~c_dr_pc~0 ~q_req_up~0))) (.cse3 (= ~p_dw_st~0 0)) (.cse19 (not (<= ~c_dr_pc~0 0))) (.cse0 (not (= ~q_req_up~0 0))) (.cse9 (not (<= 2 ~fast_clk_edge~0))) (.cse15 (not (= ~c_dr_st~0 0))) (.cse1 (and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))) (.cse20 (not (= ~q_free~0 0))) (.cse17 (not .cse2)) (.cse11 (not (<= ~c_num_read~0 0))) (.cse12 (not (<= 0 ~c_num_read~0))) (.cse14 (not (<= 0 ~p_num_write~0))) (.cse5 (not (= ~q_read_ev~0 2))) (.cse6 (not (<= 0 ~t~0))) (.cse7 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse9 .cse10 .cse1 .cse4 .cse11 .cse12 .cse13 .cse14 .cse5 .cse6 .cse7) (or .cse1 .cse2 (not (<= ~q_free~0 0)) .cse3 .cse4 .cse12 .cse14 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse9 .cse15 .cse10 .cse1 .cse16 .cse11 .cse12 .cse13 .cse14 .cse5 .cse6 .cse7) (or .cse0 .cse9 .cse15 .cse10 .cse1 .cse17 .cse16 .cse11 .cse12 .cse13 .cse14 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse10 .cse1 .cse4 .cse11 .cse12 .cse13 .cse14 .cse5 .cse6 .cse18 .cse7) (or .cse0 .cse9 .cse10 .cse1 .cse17 .cse4 .cse11 .cse12 .cse13 .cse14 .cse5 .cse6 .cse7) (or .cse19 .cse0 .cse15 .cse1 .cse20 .cse2 .cse3 .cse11 .cse12 .cse14 .cse5 .cse6 .cse18 .cse7) (or .cse19 .cse0 .cse9 .cse15 .cse1 .cse20 .cse3 .cse11 .cse12 .cse14 .cse5 .cse6 .cse7) (or .cse0 .cse9 .cse1 .cse20 .cse17 .cse4 .cse12 .cse14 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse15 .cse10 .cse1 .cse16 .cse11 .cse12 .cse13 .cse14 .cse5 .cse6 .cse18 .cse7) (or .cse0 .cse15 .cse10 .cse1 .cse2 .cse16 .cse3 .cse5 .cse6 .cse7) (or .cse19 .cse0 .cse9 .cse15 .cse1 .cse20 .cse17 .cse11 .cse12 .cse14 .cse5 .cse6 .cse7)))) [2022-10-16 17:02:50,592 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 62 90) no Hoare annotation was computed. [2022-10-16 17:02:50,592 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 62 90) no Hoare annotation was computed. [2022-10-16 17:02:50,592 INFO L899 garLoopResultBuilder]: For program point L77(lines 77 82) no Hoare annotation was computed. [2022-10-16 17:02:50,592 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 76 85) no Hoare annotation was computed. [2022-10-16 17:02:50,592 INFO L902 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 62 90) the Hoare annotation is: true [2022-10-16 17:02:50,592 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 72) no Hoare annotation was computed. [2022-10-16 17:02:50,592 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 75) no Hoare annotation was computed. [2022-10-16 17:02:50,592 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2022-10-16 17:02:50,593 INFO L902 garLoopResultBuilder]: At program point errorENTRY(lines 15 22) the Hoare annotation is: true [2022-10-16 17:02:50,593 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 15 22) no Hoare annotation was computed. [2022-10-16 17:02:50,597 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 17:02:50,600 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 17:02:50,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:02:50 BoogieIcfgContainer [2022-10-16 17:02:50,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 17:02:50,735 INFO L158 Benchmark]: Toolchain (without parser) took 179386.27ms. Allocated memory was 162.5MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 135.3MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 5.4GB. Max. memory is 8.0GB. [2022-10-16 17:02:50,735 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 162.5MB. Free memory is still 134.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 17:02:50,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.80ms. Allocated memory is still 162.5MB. Free memory was 135.1MB in the beginning and 121.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-10-16 17:02:50,740 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.86ms. Allocated memory is still 162.5MB. Free memory was 121.4MB in the beginning and 119.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-16 17:02:50,740 INFO L158 Benchmark]: Boogie Preprocessor took 43.62ms. Allocated memory is still 162.5MB. Free memory was 119.4MB in the beginning and 117.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-16 17:02:50,741 INFO L158 Benchmark]: RCFGBuilder took 790.64ms. Allocated memory is still 162.5MB. Free memory was 117.5MB in the beginning and 135.3MB in the end (delta: -17.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-10-16 17:02:50,742 INFO L158 Benchmark]: TraceAbstraction took 177885.71ms. Allocated memory was 162.5MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 134.8MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 5.4GB. Max. memory is 8.0GB. [2022-10-16 17:02:50,746 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 162.5MB. Free memory is still 134.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 593.80ms. Allocated memory is still 162.5MB. Free memory was 135.1MB in the beginning and 121.4MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.86ms. Allocated memory is still 162.5MB. Free memory was 121.4MB in the beginning and 119.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.62ms. Allocated memory is still 162.5MB. Free memory was 119.4MB in the beginning and 117.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 790.64ms. Allocated memory is still 162.5MB. Free memory was 117.5MB in the beginning and 135.3MB in the end (delta: -17.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 177885.71ms. Allocated memory was 162.5MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 134.8MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 5.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 183]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 183]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 231]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 231]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 351]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 351]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 177.7s, OverallIterations: 22, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 38.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 97.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7894 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7790 mSDsluCounter, 11635 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7147 mSDsCounter, 1948 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6604 IncrementalHoareTripleChecker+Invalid, 8552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1948 mSolverCounterUnsat, 4488 mSDtfsCounter, 6604 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3621 GetRequests, 3313 SyntacticMatches, 0 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1222 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73384occurred in iteration=18, InterpolantAutomatonStates: 214, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 29.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 15790 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 46 LocationsWithAnnotation, 46935 PreInvPairs, 50841 NumberOfFragments, 14194 HoareAnnotationTreeSize, 46935 FomulaSimplifications, 6060 FormulaSimplificationTreeSizeReduction, 42.6s HoareSimplificationTime, 46 FomulaSimplificationsInter, 1586803 FormulaSimplificationTreeSizeReductionInter, 53.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 5853 NumberOfCodeBlocks, 5853 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 5819 ConstructedInterpolants, 0 QuantifiedInterpolants, 10536 SizeOfPredicates, 0 NumberOfNonLiveVariables, 7374 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 34 InterpolantComputations, 22 PerfectInterpolantSequences, 6236/6404 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((((((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2) && c_dr_pc == q_req_up) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((0 <= t && !(p_dw_st == 0)) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2)) || ((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && q_free <= 0) && 0 <= c_num_read)) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || (((((((((0 <= t && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read) - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2) && c_dr_pc == q_req_up) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((0 <= t && !(p_dw_st == 0)) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2)) || ((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && q_free <= 0) && 0 <= c_num_read)) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || (((((((((0 <= t && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(q_req_up == 0) || (__retres1 <= 0 && 0 <= __retres1)) || p_dw_pc == 1) || p_dw_st == 0) || !(c_dr_pc == 1)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i)) && ((((((((((((!(q_req_up == 0) || !(q_req_up == p_dw_pc)) || !(2 <= fast_clk_edge)) || !(q_write_ev == q_read_ev)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((__retres1 <= 0 && 0 <= __retres1) || p_dw_pc == 1) || !(q_free <= 0)) || p_dw_st == 0) || !(c_dr_pc == 1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((((!(q_req_up == 0) || !(q_req_up == p_dw_pc)) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || !(q_write_ev == q_read_ev)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == q_req_up)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((((!(q_req_up == 0) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || !(q_write_ev == q_read_ev)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_pc == 1)) || !(c_dr_pc == q_req_up)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((((!(q_req_up == 0) || !(q_req_up == p_dw_pc)) || !(q_write_ev == q_read_ev)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i))) && ((((((((((((!(q_req_up == 0) || !(2 <= fast_clk_edge)) || !(q_write_ev == q_read_ev)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_pc == 1)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((((!(c_dr_pc <= 0) || !(q_req_up == 0)) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(q_free == 0)) || p_dw_pc == 1) || p_dw_st == 0) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i))) && ((((((((((((!(c_dr_pc <= 0) || !(q_req_up == 0)) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(q_free == 0)) || p_dw_st == 0) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((!(q_req_up == 0) || !(2 <= fast_clk_edge)) || (__retres1 <= 0 && 0 <= __retres1)) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(c_dr_pc == 1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((((!(q_req_up == 0) || !(q_req_up == p_dw_pc)) || !(c_dr_st == 0)) || !(q_write_ev == q_read_ev)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == q_req_up)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i))) && (((((((((!(q_req_up == 0) || !(c_dr_st == 0)) || !(q_write_ev == q_read_ev)) || (__retres1 <= 0 && 0 <= __retres1)) || p_dw_pc == 1) || !(c_dr_pc == q_req_up)) || p_dw_st == 0) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((((!(c_dr_pc <= 0) || !(q_req_up == 0)) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i)) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read) || ((((((((((((0 <= t && p_num_write <= 0) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || (((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((((((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2) && c_dr_pc == q_req_up) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((0 <= t && !(p_dw_st == 0)) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2)) || ((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && q_free <= 0) && 0 <= c_num_read)) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || (((((((((0 <= t && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: ((((((((((0 <= t && p_num_write <= 0) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read) - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: ((((((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2) && c_dr_pc == q_req_up) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((0 <= t && !(p_dw_st == 0)) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2)) || ((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && q_free <= 0) && 0 <= c_num_read)) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || (((((((((0 <= t && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read) - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(c_dr_pc <= 0) || !(q_req_up == 0)) || !(c_dr_st == 0)) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i)) && ((((((((((!(2 <= slow_clk_edge) || p_dw_pc == 1) || !(q_free <= 0)) || p_dw_st == 0) || !(c_dr_pc == 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((((!(q_req_up == 0) || !(c_dr_st == 0)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 1)) || !(c_dr_pc == q_req_up)) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i))) && ((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(q_req_up == p_dw_pc)) || !(q_write_ev == q_read_ev)) || !(2 <= slow_clk_edge)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i))) && (((((((((!(q_req_up == 0) || !(c_dr_st == 0)) || !(q_write_ev == q_read_ev)) || p_dw_pc == 1) || !(c_dr_pc == q_req_up)) || p_dw_st == 0) || (__retres1 <= 0 && 0 <= __retres1)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((((!(c_dr_pc <= 0) || !(q_req_up == 0)) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((((!(q_req_up == 0) || !(q_req_up == p_dw_pc)) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || !(q_write_ev == q_read_ev)) || !(c_dr_pc == q_req_up)) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(q_req_up == p_dw_pc)) || !(2 <= fast_clk_edge)) || !(q_write_ev == q_read_ev)) || !(2 <= slow_clk_edge)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((((!(q_req_up == 0) || !(q_req_up == p_dw_pc)) || !(c_dr_st == 0)) || !(q_write_ev == q_read_ev)) || !(c_dr_pc == q_req_up)) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i))) && (((((((((((((!(q_req_up == 0) || !(q_write_ev == q_read_ev)) || !(2 <= slow_clk_edge)) || !(p_dw_pc == 1)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i))) && (((((((((((((!(q_req_up == 0) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || !(q_write_ev == q_read_ev)) || !(p_dw_pc == 1)) || !(c_dr_pc == q_req_up)) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((!(q_req_up == 0) || !(2 <= fast_clk_edge)) || !(q_free == 0)) || !(2 <= slow_clk_edge)) || !(p_dw_pc == 1)) || !(c_dr_pc == 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((((!(q_req_up == 0) || !(2 <= fast_clk_edge)) || !(q_write_ev == q_read_ev)) || !(2 <= slow_clk_edge)) || !(p_dw_pc == 1)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((((!(c_dr_pc <= 0) || !(q_req_up == 0)) || !(c_dr_st == 0)) || !(q_free == 0)) || p_dw_st == 0) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i))) && ((((((((((((!(c_dr_pc <= 0) || !(q_req_up == 0)) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || !(q_free == 0)) || p_dw_st == 0) || !(c_num_read <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((!(q_req_up == 0) || !(q_free == 0)) || !(2 <= slow_clk_edge)) || !(p_dw_pc == 1)) || !(c_dr_pc == 1)) || (__retres1 <= 0 && 0 <= __retres1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(q_read_ev == 2)) || !(0 <= t)) || !(fast_clk_edge == 1)) || !(1 == c_dr_i)) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && 2 <= fast_clk_edge) && (((((q_write_ev == q_read_ev && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && q_req_up == p_dw_pc) || ((((q_write_ev == q_read_ev && q_req_up == 0) && q_read_ev == 2) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up))) && 0 <= c_num_read) || ((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || (((((0 <= t && !(p_dw_st == 0)) && 1 == c_dr_i) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2)) || ((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || ((((((((0 <= t && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && !(p_dw_pc == 1)) && q_read_ev == 2) && q_free <= 0) && 0 <= c_num_read) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: ((((((((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2) && c_dr_pc == q_req_up) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read)) || (((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((0 <= t && !(p_dw_st == 0)) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2)) || ((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && q_free <= 0) && 0 <= c_num_read)) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || (((((((((0 <= t && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || ((((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((((((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read) || (((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || (((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((((((((0 <= t && p_num_write <= 0) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && q_req_up == p_dw_pc) && 0 <= c_num_read) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: ((((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && t <= 0) && 2 <= slow_clk_edge) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read) || (((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && t <= 0) && q_read_ev == 2) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(c_dr_pc <= 0) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || !(q_free == 0)) || p_dw_st == 0) || !(\old(q_read_ev) == 2)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i)) && ((((((((((((!(2 <= fast_clk_edge) || !(\old(q_read_ev) == \old(q_write_ev))) || !(c_dr_st == 0)) || !(c_dr_pc == \old(q_req_up))) || !(\old(q_read_ev) == 2)) || !(p_dw_pc == \old(q_req_up))) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((((((!(c_dr_pc <= 0) || !(2 <= fast_clk_edge)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(c_dr_st == 0)) || !(q_free == 0)) || !(p_dw_pc == 1)) || p_dw_st == 0) || !(\old(q_read_ev) == 2)) || !(p_dw_pc == \old(q_req_up))) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || ((q_req_up == 0 && \old(q_read_ev) == q_read_ev) && q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((((!(2 <= fast_clk_edge) || !(\old(q_read_ev) == \old(q_write_ev))) || !(c_dr_st == 0)) || !(p_dw_pc == 1)) || !(c_dr_pc == \old(q_req_up))) || !(\old(q_read_ev) == 2)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((!(2 <= fast_clk_edge) || !(\old(q_read_ev) == \old(q_write_ev))) || !(p_dw_pc == 1)) || !(\old(q_read_ev) == 2)) || !(c_dr_pc == 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((!(2 <= fast_clk_edge) || !(\old(q_read_ev) == \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(c_dr_pc == 1)) || !(p_dw_pc == \old(q_req_up))) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(p_num_write <= 0)) || !(0 <= p_num_write)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((p_dw_pc == 1 || !(q_free <= 0)) || p_dw_st == 0) || !(\old(q_read_ev) == 2)) || !(c_dr_pc == 1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || ((q_req_up == 0 && \old(q_read_ev) == q_read_ev) && q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((((!(c_dr_pc <= 0) || !(2 <= fast_clk_edge)) || !(c_dr_st == 0)) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(\old(q_read_ev) == 2)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((p_dw_pc == 1 || p_dw_st == 0) || !(\old(q_read_ev) == 2)) || !(c_dr_pc == 1)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i))) && (((((((((!(2 <= fast_clk_edge) || !(q_free == 0)) || !(p_dw_pc == 1)) || !(\old(q_read_ev) == 2)) || !(c_dr_pc == 1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((((!(2 <= fast_clk_edge) || !(q_free == 0)) || !(c_dr_pc == \old(q_req_up))) || p_dw_st == 0) || !(\old(q_read_ev) == 2)) || !(c_dr_pc == 1)) || !(0 <= c_num_read)) || !(0 <= p_num_write)) || ((q_req_up == 0 && \old(q_read_ev) == q_read_ev) && q_read_ev == 2)) || !(0 <= t)) || !(1 == c_dr_i))) && ((((((((!(\old(q_read_ev) == \old(q_write_ev)) || !(c_dr_st == 0)) || p_dw_pc == 1) || !(c_dr_pc == \old(q_req_up))) || p_dw_st == 0) || !(\old(q_read_ev) == 2)) || !(\old(q_req_up) == 0)) || !(0 <= t)) || !(1 == c_dr_i)) - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: ((((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && p_dw_st == 0) && t <= 0) && 2 <= slow_clk_edge) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read) || ((((((0 <= t && !(p_dw_st == 0)) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2)) || ((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && q_free <= 0) && 0 <= c_num_read)) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || (((((((((0 <= t && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || ((((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && fast_clk_edge == 1) && 0 <= c_num_read) || ((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2) && c_dr_pc == q_req_up)) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && fast_clk_edge == 1) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && fast_clk_edge == 1) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || (((((((((0 <= t && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && fast_clk_edge == 1) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && fast_clk_edge == 1) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((0 <= t && !(p_dw_st == 0)) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2)) || ((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && q_free <= 0) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && q_read_ev == 2) && fast_clk_edge == 1) && c_dr_pc <= 0) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && fast_clk_edge == 1) && c_dr_pc <= 0) && 0 <= c_num_read) - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ((((((((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2) && c_dr_pc == q_req_up) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read)) || (((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || ((((((0 <= t && !(p_dw_st == 0)) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2)) || ((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && q_free <= 0) && 0 <= c_num_read)) || (((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || (((((((((((0 <= t && p_num_write <= 0) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || (((((((((0 <= t && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && q_write_ev == q_read_ev) && 1 == c_dr_i) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2) && c_dr_pc == q_req_up) || ((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && !(p_dw_pc == 1)) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && 0 <= c_num_read)) || (((((((((((0 <= t && p_num_write <= 0) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || ((((((((((((c_dr_st == 0 && 0 <= t) && p_num_write <= 0) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_req_up == 0) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc == q_req_up) && 0 <= c_num_read)) || (((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && 0 <= c_num_read)) || (((((((((((((c_dr_st == 0 && 0 <= t) && !(p_dw_st == 0)) && c_num_read <= 0) && q_write_ev == q_read_ev) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && c_dr_pc <= 0) && q_req_up == p_dw_pc) && 0 <= c_num_read)) || ((((((0 <= t && !(p_dw_st == 0)) && 1 == c_dr_i) && q_req_up == 0) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2)) || ((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && c_dr_pc == 1) && !(p_dw_pc == 1)) && q_read_ev == 2) && q_free <= 0) && 0 <= c_num_read)) || ((((((((((0 <= t && !(p_dw_st == 0)) && 0 <= p_num_write) && 1 == c_dr_i) && q_free == 0) && p_dw_pc == 1) && q_read_ev == 2) && 2 <= fast_clk_edge) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && 0 <= c_num_read) RESULT: Ultimate proved your program to be correct! [2022-10-16 17:02:50,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...