/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/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 21:07:42,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:07:42,478 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:07:42,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:07:42,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:07:42,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:07:42,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:07:42,527 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:07:42,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:07:42,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:07:42,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:07:42,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:07:42,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:07:42,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:07:42,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:07:42,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:07:42,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:07:42,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:07:42,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:07:42,546 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:07:42,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:07:42,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:07:42,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:07:42,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:07:42,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:07:42,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:07:42,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:07:42,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:07:42,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:07:42,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:07:42,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:07:42,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:07:42,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:07:42,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:07:42,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:07:42,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:07:42,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:07:42,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:07:42,589 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:07:42,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:07:42,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:07:42,592 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-15 21:07:42,649 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:07:42,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:07:42,650 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:07:42,650 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:07:42,652 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:07:42,652 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:07:42,655 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:07:42,655 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:07:42,655 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:07:42,656 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:07:42,657 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:07:42,657 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:07:42,657 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:07:42,657 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:07:42,657 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:07:42,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:07:42,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:07:42,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:07:42,658 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:07:42,659 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:07:42,659 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:07:42,659 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:07:42,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:07:42,660 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:07:42,660 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:07:42,660 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:07:42,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:07:42,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:07:42,661 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:07:42,661 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:07:42,661 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:07:42,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:07:42,662 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:07:42,662 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-15 21:07:43,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:07:43,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:07:43,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:07:43,084 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:07:43,085 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:07:43,087 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2022-10-15 21:07:43,174 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2b06657e/a3e70c031ac346aab111bb26930c3d44/FLAG68f26153f [2022-10-15 21:07:44,079 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:07:44,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2022-10-15 21:07:44,108 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2b06657e/a3e70c031ac346aab111bb26930c3d44/FLAG68f26153f [2022-10-15 21:07:44,154 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2b06657e/a3e70c031ac346aab111bb26930c3d44 [2022-10-15 21:07:44,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:07:44,165 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:07:44,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:07:44,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:07:44,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:07:44,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:07:44" (1/1) ... [2022-10-15 21:07:44,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@523864ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:44, skipping insertion in model container [2022-10-15 21:07:44,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:07:44" (1/1) ... [2022-10-15 21:07:44,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:07:44,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:07:45,023 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/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i[73128,73141] [2022-10-15 21:07:45,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:07:45,170 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:07:45,283 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/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i[73128,73141] [2022-10-15 21:07:45,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:07:45,365 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:07:45,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:45 WrapperNode [2022-10-15 21:07:45,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:07:45,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:07:45,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:07:45,368 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:07:45,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:45" (1/1) ... [2022-10-15 21:07:45,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:45" (1/1) ... [2022-10-15 21:07:45,490 INFO L138 Inliner]: procedures = 99, calls = 345, calls flagged for inlining = 40, calls inlined = 32, statements flattened = 750 [2022-10-15 21:07:45,490 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:07:45,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:07:45,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:07:45,493 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:07:45,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:45" (1/1) ... [2022-10-15 21:07:45,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:45" (1/1) ... [2022-10-15 21:07:45,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:45" (1/1) ... [2022-10-15 21:07:45,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:45" (1/1) ... [2022-10-15 21:07:45,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:45" (1/1) ... [2022-10-15 21:07:45,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:45" (1/1) ... [2022-10-15 21:07:45,621 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:45" (1/1) ... [2022-10-15 21:07:45,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:45" (1/1) ... [2022-10-15 21:07:45,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:07:45,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:07:45,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:07:45,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:07:45,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:45" (1/1) ... [2022-10-15 21:07:45,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:07:45,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:07:45,680 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-15 21:07:45,703 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-15 21:07:45,757 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_list_voltage_linear [2022-10-15 21:07:45,757 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_list_voltage_linear [2022-10-15 21:07:45,757 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-15 21:07:45,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-15 21:07:45,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 21:07:45,758 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-10-15 21:07:45,758 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-10-15 21:07:45,758 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-10-15 21:07:45,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-10-15 21:07:45,758 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_unregister [2022-10-15 21:07:45,759 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_unregister [2022-10-15 21:07:45,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 21:07:45,759 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-10-15 21:07:45,759 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-10-15 21:07:45,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:07:45,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 21:07:45,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 21:07:45,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 21:07:45,760 INFO L130 BoogieDeclarations]: Found specification of procedure rdev_get_drvdata [2022-10-15 21:07:45,760 INFO L138 BoogieDeclarations]: Found implementation of procedure rdev_get_drvdata [2022-10-15 21:07:45,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 21:07:45,761 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mtx_of_isl_pmic [2022-10-15 21:07:45,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mtx_of_isl_pmic [2022-10-15 21:07:45,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-15 21:07:45,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:07:45,761 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2022-10-15 21:07:45,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2022-10-15 21:07:45,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:07:45,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:07:45,762 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-10-15 21:07:45,762 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-10-15 21:07:46,048 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:07:46,051 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:07:46,996 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:07:47,006 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:07:47,007 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 21:07:47,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:07:47 BoogieIcfgContainer [2022-10-15 21:07:47,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:07:47,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:07:47,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:07:47,017 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:07:47,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:07:44" (1/3) ... [2022-10-15 21:07:47,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23913ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:07:47, skipping insertion in model container [2022-10-15 21:07:47,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:07:45" (2/3) ... [2022-10-15 21:07:47,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23913ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:07:47, skipping insertion in model container [2022-10-15 21:07:47,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:07:47" (3/3) ... [2022-10-15 21:07:47,021 INFO L112 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2022-10-15 21:07:47,043 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:07:47,043 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-10-15 21:07:47,114 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:07:47,124 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;@e7e4a4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:07:47,124 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-10-15 21:07:47,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 145 states have (on average 1.4206896551724137) internal successors, (206), 161 states have internal predecessors, (206), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-10-15 21:07:47,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 21:07:47,145 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:47,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:07:47,147 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:07:47,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:47,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1444456607, now seen corresponding path program 1 times [2022-10-15 21:07:47,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:47,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720761438] [2022-10-15 21:07:47,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:47,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:47,846 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-15 21:07:47,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:47,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720761438] [2022-10-15 21:07:47,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720761438] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:47,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:07:47,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:07:47,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011727511] [2022-10-15 21:07:47,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:47,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:07:47,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:47,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:07:47,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:07:47,897 INFO L87 Difference]: Start difference. First operand has 192 states, 145 states have (on average 1.4206896551724137) internal successors, (206), 161 states have internal predecessors, (206), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-15 21:07:48,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:48,188 INFO L93 Difference]: Finished difference Result 497 states and 696 transitions. [2022-10-15 21:07:48,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:07:48,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 21:07:48,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:48,211 INFO L225 Difference]: With dead ends: 497 [2022-10-15 21:07:48,211 INFO L226 Difference]: Without dead ends: 272 [2022-10-15 21:07:48,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:07:48,229 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 156 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:48,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 501 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 21:07:48,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-10-15 21:07:48,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2022-10-15 21:07:48,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 211 states have (on average 1.3791469194312795) internal successors, (291), 220 states have internal predecessors, (291), 34 states have call successors, (34), 17 states have call predecessors, (34), 17 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-10-15 21:07:48,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 359 transitions. [2022-10-15 21:07:48,327 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 359 transitions. Word has length 15 [2022-10-15 21:07:48,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:48,327 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 359 transitions. [2022-10-15 21:07:48,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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-15 21:07:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 359 transitions. [2022-10-15 21:07:48,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-15 21:07:48,335 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:48,335 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 21:07:48,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:07:48,338 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:07:48,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:48,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2072638708, now seen corresponding path program 1 times [2022-10-15 21:07:48,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:48,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497245520] [2022-10-15 21:07:48,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:48,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:48,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 21:07:48,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:48,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497245520] [2022-10-15 21:07:48,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497245520] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:48,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:07:48,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 21:07:48,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528326742] [2022-10-15 21:07:48,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:48,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:07:48,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:48,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:07:48,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:07:48,745 INFO L87 Difference]: Start difference. First operand 272 states and 359 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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-15 21:07:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:48,877 INFO L93 Difference]: Finished difference Result 541 states and 715 transitions. [2022-10-15 21:07:48,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:07:48,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-10-15 21:07:48,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:48,884 INFO L225 Difference]: With dead ends: 541 [2022-10-15 21:07:48,884 INFO L226 Difference]: Without dead ends: 537 [2022-10-15 21:07:48,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:07:48,887 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 196 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:48,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 453 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:07:48,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-10-15 21:07:48,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 531. [2022-10-15 21:07:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 419 states have (on average 1.3723150357995226) internal successors, (575), 428 states have internal predecessors, (575), 68 states have call successors, (68), 34 states have call predecessors, (68), 34 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-10-15 21:07:48,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 711 transitions. [2022-10-15 21:07:48,997 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 711 transitions. Word has length 26 [2022-10-15 21:07:48,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:49,000 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 711 transitions. [2022-10-15 21:07:49,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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-15 21:07:49,001 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 711 transitions. [2022-10-15 21:07:49,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-15 21:07:49,010 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:49,010 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 21:07:49,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:07:49,011 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:07:49,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:49,011 INFO L85 PathProgramCache]: Analyzing trace with hash -482153609, now seen corresponding path program 1 times [2022-10-15 21:07:49,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:49,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480152542] [2022-10-15 21:07:49,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:49,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:49,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 21:07:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:49,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-15 21:07:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:49,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:07:49,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:49,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480152542] [2022-10-15 21:07:49,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480152542] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:49,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:07:49,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:07:49,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247574459] [2022-10-15 21:07:49,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:49,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:07:49,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:49,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:07:49,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:07:49,258 INFO L87 Difference]: Start difference. First operand 531 states and 711 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:07:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:49,891 INFO L93 Difference]: Finished difference Result 1179 states and 1583 transitions. [2022-10-15 21:07:49,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:07:49,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-10-15 21:07:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:49,906 INFO L225 Difference]: With dead ends: 1179 [2022-10-15 21:07:49,907 INFO L226 Difference]: Without dead ends: 651 [2022-10-15 21:07:49,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:07:49,913 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 203 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:49,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 718 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 21:07:49,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-10-15 21:07:49,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 626. [2022-10-15 21:07:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 493 states have (on average 1.3671399594320486) internal successors, (674), 502 states have internal predecessors, (674), 80 states have call successors, (80), 43 states have call predecessors, (80), 43 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2022-10-15 21:07:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 834 transitions. [2022-10-15 21:07:49,989 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 834 transitions. Word has length 36 [2022-10-15 21:07:49,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:49,989 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 834 transitions. [2022-10-15 21:07:49,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 21:07:49,990 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 834 transitions. [2022-10-15 21:07:49,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-15 21:07:49,993 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:49,993 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-10-15 21:07:49,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 21:07:49,994 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:07:49,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:49,994 INFO L85 PathProgramCache]: Analyzing trace with hash 888153265, now seen corresponding path program 1 times [2022-10-15 21:07:49,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:49,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330357244] [2022-10-15 21:07:49,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:49,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 21:07:50,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:50,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330357244] [2022-10-15 21:07:50,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330357244] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:50,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:07:50,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:07:50,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095061540] [2022-10-15 21:07:50,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:50,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:07:50,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:50,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:07:50,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:07:50,248 INFO L87 Difference]: Start difference. First operand 626 states and 834 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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-15 21:07:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:50,766 INFO L93 Difference]: Finished difference Result 1300 states and 1729 transitions. [2022-10-15 21:07:50,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:07:50,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-10-15 21:07:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:50,781 INFO L225 Difference]: With dead ends: 1300 [2022-10-15 21:07:50,782 INFO L226 Difference]: Without dead ends: 920 [2022-10-15 21:07:50,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:07:50,797 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 269 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:50,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 929 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 21:07:50,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2022-10-15 21:07:50,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 630. [2022-10-15 21:07:50,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 497 states have (on average 1.364185110663984) internal successors, (678), 506 states have internal predecessors, (678), 80 states have call successors, (80), 43 states have call predecessors, (80), 43 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2022-10-15 21:07:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 838 transitions. [2022-10-15 21:07:50,899 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 838 transitions. Word has length 39 [2022-10-15 21:07:50,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:50,899 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 838 transitions. [2022-10-15 21:07:50,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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-15 21:07:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 838 transitions. [2022-10-15 21:07:50,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-10-15 21:07:50,906 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:50,907 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 21:07:50,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 21:07:50,908 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:07:50,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:50,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1659416553, now seen corresponding path program 1 times [2022-10-15 21:07:50,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:50,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669225000] [2022-10-15 21:07:50,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:50,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:51,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:07:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:51,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-15 21:07:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:51,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:07:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:51,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 21:07:51,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:51,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669225000] [2022-10-15 21:07:51,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669225000] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:51,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:07:51,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:07:51,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973803009] [2022-10-15 21:07:51,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:51,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:07:51,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:51,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:07:51,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:07:51,328 INFO L87 Difference]: Start difference. First operand 630 states and 838 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 21:07:51,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:51,847 INFO L93 Difference]: Finished difference Result 1212 states and 1624 transitions. [2022-10-15 21:07:51,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:07:51,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2022-10-15 21:07:51,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:51,855 INFO L225 Difference]: With dead ends: 1212 [2022-10-15 21:07:51,856 INFO L226 Difference]: Without dead ends: 685 [2022-10-15 21:07:51,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:07:51,859 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 29 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:51,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 533 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-15 21:07:51,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-10-15 21:07:51,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 660. [2022-10-15 21:07:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 523 states have (on average 1.349904397705545) internal successors, (706), 532 states have internal predecessors, (706), 84 states have call successors, (84), 43 states have call predecessors, (84), 43 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2022-10-15 21:07:51,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 874 transitions. [2022-10-15 21:07:51,924 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 874 transitions. Word has length 51 [2022-10-15 21:07:51,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:51,925 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 874 transitions. [2022-10-15 21:07:51,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-10-15 21:07:51,925 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 874 transitions. [2022-10-15 21:07:51,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-15 21:07:51,927 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:51,928 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 21:07:51,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 21:07:51,928 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:07:51,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:51,929 INFO L85 PathProgramCache]: Analyzing trace with hash -757179182, now seen corresponding path program 1 times [2022-10-15 21:07:51,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:51,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69169108] [2022-10-15 21:07:51,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:51,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:52,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:07:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:52,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-15 21:07:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:52,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:07:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:52,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-10-15 21:07:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 21:07:52,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:52,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69169108] [2022-10-15 21:07:52,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69169108] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:52,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:07:52,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 21:07:52,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397385020] [2022-10-15 21:07:52,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:52,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 21:07:52,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:52,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 21:07:52,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:07:52,440 INFO L87 Difference]: Start difference. First operand 660 states and 874 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:07:53,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:53,571 INFO L93 Difference]: Finished difference Result 1364 states and 1860 transitions. [2022-10-15 21:07:53,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:07:53,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 61 [2022-10-15 21:07:53,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:53,580 INFO L225 Difference]: With dead ends: 1364 [2022-10-15 21:07:53,581 INFO L226 Difference]: Without dead ends: 807 [2022-10-15 21:07:53,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-10-15 21:07:53,584 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 157 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:53,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1595 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-10-15 21:07:53,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2022-10-15 21:07:53,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 630. [2022-10-15 21:07:53,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 499 states have (on average 1.346693386773547) internal successors, (672), 506 states have internal predecessors, (672), 82 states have call successors, (82), 41 states have call predecessors, (82), 41 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2022-10-15 21:07:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 836 transitions. [2022-10-15 21:07:53,650 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 836 transitions. Word has length 61 [2022-10-15 21:07:53,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:53,652 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 836 transitions. [2022-10-15 21:07:53,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 21:07:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 836 transitions. [2022-10-15 21:07:53,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-10-15 21:07:53,655 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:53,656 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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-15 21:07:53,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 21:07:53,656 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:07:53,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:53,657 INFO L85 PathProgramCache]: Analyzing trace with hash 550582253, now seen corresponding path program 1 times [2022-10-15 21:07:53,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:53,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530773797] [2022-10-15 21:07:53,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:53,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:53,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:07:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:53,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-15 21:07:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:53,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:07:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:53,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:07:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:53,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:07:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-10-15 21:07:53,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:53,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530773797] [2022-10-15 21:07:53,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530773797] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:53,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:07:53,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:07:53,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236561620] [2022-10-15 21:07:53,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:53,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:07:53,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:53,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:07:53,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:07:54,000 INFO L87 Difference]: Start difference. First operand 630 states and 836 transitions. Second operand has 4 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 21:07:54,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:54,525 INFO L93 Difference]: Finished difference Result 655 states and 873 transitions. [2022-10-15 21:07:54,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:07:54,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 71 [2022-10-15 21:07:54,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:54,531 INFO L225 Difference]: With dead ends: 655 [2022-10-15 21:07:54,531 INFO L226 Difference]: Without dead ends: 654 [2022-10-15 21:07:54,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:07:54,532 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 28 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:54,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 499 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 21:07:54,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-10-15 21:07:54,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 629. [2022-10-15 21:07:54,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 499 states have (on average 1.342685370741483) internal successors, (670), 505 states have internal predecessors, (670), 82 states have call successors, (82), 41 states have call predecessors, (82), 41 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2022-10-15 21:07:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 834 transitions. [2022-10-15 21:07:54,584 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 834 transitions. Word has length 71 [2022-10-15 21:07:54,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:54,585 INFO L495 AbstractCegarLoop]: Abstraction has 629 states and 834 transitions. [2022-10-15 21:07:54,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 21:07:54,585 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 834 transitions. [2022-10-15 21:07:54,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-10-15 21:07:54,587 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:54,587 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-15 21:07:54,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 21:07:54,588 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:07:54,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:54,589 INFO L85 PathProgramCache]: Analyzing trace with hash -111819200, now seen corresponding path program 1 times [2022-10-15 21:07:54,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:54,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592994443] [2022-10-15 21:07:54,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:54,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:54,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:07:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:54,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-15 21:07:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:54,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:07:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:54,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:07:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:54,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:07:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 21:07:54,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:54,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592994443] [2022-10-15 21:07:54,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592994443] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:07:54,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110505458] [2022-10-15 21:07:54,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:54,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:07:54,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:07:54,901 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-15 21:07:54,922 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-15 21:07:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:55,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:07:55,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:07:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-15 21:07:55,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:07:55,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110505458] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:55,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:07:55,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-10-15 21:07:55,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025658786] [2022-10-15 21:07:55,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:55,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:07:55,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:55,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:07:55,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:07:55,388 INFO L87 Difference]: Start difference. First operand 629 states and 834 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 21:07:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:55,928 INFO L93 Difference]: Finished difference Result 1294 states and 1755 transitions. [2022-10-15 21:07:55,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:07:55,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 72 [2022-10-15 21:07:55,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:55,934 INFO L225 Difference]: With dead ends: 1294 [2022-10-15 21:07:55,935 INFO L226 Difference]: Without dead ends: 768 [2022-10-15 21:07:55,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:07:55,937 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 237 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:55,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 508 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-15 21:07:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2022-10-15 21:07:55,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 610. [2022-10-15 21:07:55,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 485 states have (on average 1.3443298969072166) internal successors, (652), 490 states have internal predecessors, (652), 78 states have call successors, (78), 41 states have call predecessors, (78), 41 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2022-10-15 21:07:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 808 transitions. [2022-10-15 21:07:55,999 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 808 transitions. Word has length 72 [2022-10-15 21:07:56,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:56,000 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 808 transitions. [2022-10-15 21:07:56,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 21:07:56,000 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 808 transitions. [2022-10-15 21:07:56,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-10-15 21:07:56,003 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:56,003 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-15 21:07:56,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-15 21:07:56,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:07:56,218 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:07:56,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:56,219 INFO L85 PathProgramCache]: Analyzing trace with hash 578302560, now seen corresponding path program 1 times [2022-10-15 21:07:56,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:56,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635215703] [2022-10-15 21:07:56,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:56,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:56,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:07:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:56,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-15 21:07:56,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:56,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:07:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:56,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-15 21:07:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-15 21:07:56,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:56,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635215703] [2022-10-15 21:07:56,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635215703] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:07:56,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277827348] [2022-10-15 21:07:56,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:56,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:07:56,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:07:56,542 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-15 21:07:56,558 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-15 21:07:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:56,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 1339 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 21:07:56,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:07:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-10-15 21:07:56,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:07:56,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277827348] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:56,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:07:56,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-10-15 21:07:56,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019133452] [2022-10-15 21:07:56,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:56,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:07:56,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:56,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:07:56,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:07:56,957 INFO L87 Difference]: Start difference. First operand 610 states and 808 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-15 21:07:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:57,022 INFO L93 Difference]: Finished difference Result 984 states and 1306 transitions. [2022-10-15 21:07:57,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:07:57,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 78 [2022-10-15 21:07:57,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:57,027 INFO L225 Difference]: With dead ends: 984 [2022-10-15 21:07:57,028 INFO L226 Difference]: Without dead ends: 616 [2022-10-15 21:07:57,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:07:57,034 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 5 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:57,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 407 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:07:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-10-15 21:07:57,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 615. [2022-10-15 21:07:57,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 489 states have (on average 1.3415132924335378) internal successors, (656), 494 states have internal predecessors, (656), 79 states have call successors, (79), 41 states have call predecessors, (79), 41 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-10-15 21:07:57,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 814 transitions. [2022-10-15 21:07:57,088 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 814 transitions. Word has length 78 [2022-10-15 21:07:57,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:57,089 INFO L495 AbstractCegarLoop]: Abstraction has 615 states and 814 transitions. [2022-10-15 21:07:57,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-15 21:07:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 814 transitions. [2022-10-15 21:07:57,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-10-15 21:07:57,095 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:57,095 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2022-10-15 21:07:57,138 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-15 21:07:57,302 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,SelfDestructingSolverStorable8 [2022-10-15 21:07:57,302 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:07:57,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:57,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1125025893, now seen corresponding path program 1 times [2022-10-15 21:07:57,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:57,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427531031] [2022-10-15 21:07:57,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:57,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:57,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:07:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:57,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-15 21:07:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:57,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:07:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:57,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-15 21:07:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:57,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:07:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:57,606 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-15 21:07:57,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:57,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427531031] [2022-10-15 21:07:57,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427531031] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:07:57,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299860342] [2022-10-15 21:07:57,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:57,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:07:57,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:07:57,614 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-15 21:07:57,634 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-15 21:07:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:57,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-15 21:07:57,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:07:58,011 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-10-15 21:07:58,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:07:58,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299860342] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:07:58,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:07:58,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-10-15 21:07:58,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672758452] [2022-10-15 21:07:58,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:07:58,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:07:58,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:58,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:07:58,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:07:58,015 INFO L87 Difference]: Start difference. First operand 615 states and 814 transitions. Second operand has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 21:07:58,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:58,105 INFO L93 Difference]: Finished difference Result 854 states and 1186 transitions. [2022-10-15 21:07:58,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:07:58,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 83 [2022-10-15 21:07:58,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:58,112 INFO L225 Difference]: With dead ends: 854 [2022-10-15 21:07:58,112 INFO L226 Difference]: Without dead ends: 853 [2022-10-15 21:07:58,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:07:58,114 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 130 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:58,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 564 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:07:58,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2022-10-15 21:07:58,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 614. [2022-10-15 21:07:58,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 489 states have (on average 1.3394683026584866) internal successors, (655), 493 states have internal predecessors, (655), 79 states have call successors, (79), 41 states have call predecessors, (79), 41 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2022-10-15 21:07:58,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 813 transitions. [2022-10-15 21:07:58,184 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 813 transitions. Word has length 83 [2022-10-15 21:07:58,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:58,184 INFO L495 AbstractCegarLoop]: Abstraction has 614 states and 813 transitions. [2022-10-15 21:07:58,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 21:07:58,185 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 813 transitions. [2022-10-15 21:07:58,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-10-15 21:07:58,188 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:58,188 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:07:58,235 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-15 21:07:58,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:07:58,403 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:07:58,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:07:58,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1917470559, now seen corresponding path program 1 times [2022-10-15 21:07:58,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:07:58,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657657750] [2022-10-15 21:07:58,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:58,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:07:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:58,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:07:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:58,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-15 21:07:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:58,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:07:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:58,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-15 21:07:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:58,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:07:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 21:07:58,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:07:58,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657657750] [2022-10-15 21:07:58,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657657750] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:07:58,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503124119] [2022-10-15 21:07:58,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:07:58,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:07:58,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:07:58,663 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-15 21:07:58,670 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-15 21:07:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:07:59,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 1361 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:07:59,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:07:59,052 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-15 21:07:59,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:07:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-15 21:07:59,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503124119] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:07:59,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:07:59,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-10-15 21:07:59,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385404349] [2022-10-15 21:07:59,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:07:59,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 21:07:59,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:07:59,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 21:07:59,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:07:59,126 INFO L87 Difference]: Start difference. First operand 614 states and 813 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 5 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-10-15 21:07:59,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:07:59,857 INFO L93 Difference]: Finished difference Result 1194 states and 1584 transitions. [2022-10-15 21:07:59,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 21:07:59,858 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 5 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 87 [2022-10-15 21:07:59,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:07:59,864 INFO L225 Difference]: With dead ends: 1194 [2022-10-15 21:07:59,864 INFO L226 Difference]: Without dead ends: 683 [2022-10-15 21:07:59,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:07:59,867 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 52 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 21:07:59,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 832 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 21:07:59,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-10-15 21:07:59,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 658. [2022-10-15 21:07:59,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 525 states have (on average 1.3161904761904761) internal successors, (691), 529 states have internal predecessors, (691), 87 states have call successors, (87), 41 states have call predecessors, (87), 41 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2022-10-15 21:07:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 865 transitions. [2022-10-15 21:07:59,936 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 865 transitions. Word has length 87 [2022-10-15 21:07:59,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:07:59,936 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 865 transitions. [2022-10-15 21:07:59,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 6 states have internal predecessors, (99), 5 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-10-15 21:07:59,937 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 865 transitions. [2022-10-15 21:07:59,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-10-15 21:07:59,958 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:07:59,959 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-10-15 21:08:00,003 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-15 21:08:00,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:08:00,171 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:08:00,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:08:00,173 INFO L85 PathProgramCache]: Analyzing trace with hash 775940619, now seen corresponding path program 1 times [2022-10-15 21:08:00,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:08:00,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745546769] [2022-10-15 21:08:00,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:08:00,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:08:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:00,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:08:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:00,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-15 21:08:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:00,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:08:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:00,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:08:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:00,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:08:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:00,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:08:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:00,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-15 21:08:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:00,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-15 21:08:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:00,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-15 21:08:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:00,497 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-10-15 21:08:00,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:08:00,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745546769] [2022-10-15 21:08:00,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745546769] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:08:00,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495456439] [2022-10-15 21:08:00,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:08:00,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:08:00,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:08:00,500 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-15 21:08:00,516 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-15 21:08:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:00,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 1623 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:08:00,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:08:01,079 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-10-15 21:08:01,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 21:08:01,238 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-10-15 21:08:01,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495456439] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 21:08:01,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 21:08:01,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2022-10-15 21:08:01,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580199958] [2022-10-15 21:08:01,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 21:08:01,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 21:08:01,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:08:01,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 21:08:01,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:08:01,241 INFO L87 Difference]: Start difference. First operand 658 states and 865 transitions. Second operand has 9 states, 9 states have (on average 22.444444444444443) internal successors, (202), 8 states have internal predecessors, (202), 6 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-10-15 21:08:02,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:08:02,346 INFO L93 Difference]: Finished difference Result 2073 states and 2756 transitions. [2022-10-15 21:08:02,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-15 21:08:02,346 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 22.444444444444443) internal successors, (202), 8 states have internal predecessors, (202), 6 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 127 [2022-10-15 21:08:02,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:08:02,357 INFO L225 Difference]: With dead ends: 2073 [2022-10-15 21:08:02,357 INFO L226 Difference]: Without dead ends: 1679 [2022-10-15 21:08:02,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-10-15 21:08:02,360 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 1056 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-10-15 21:08:02,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1116 Valid, 954 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-10-15 21:08:02,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2022-10-15 21:08:02,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1218. [2022-10-15 21:08:02,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 978 states have (on average 1.3077709611451942) internal successors, (1279), 981 states have internal predecessors, (1279), 162 states have call successors, (162), 74 states have call predecessors, (162), 74 states have return successors, (162), 162 states have call predecessors, (162), 162 states have call successors, (162) [2022-10-15 21:08:02,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1603 transitions. [2022-10-15 21:08:02,510 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1603 transitions. Word has length 127 [2022-10-15 21:08:02,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:08:02,510 INFO L495 AbstractCegarLoop]: Abstraction has 1218 states and 1603 transitions. [2022-10-15 21:08:02,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.444444444444443) internal successors, (202), 8 states have internal predecessors, (202), 6 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2022-10-15 21:08:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1603 transitions. [2022-10-15 21:08:02,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-10-15 21:08:02,517 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:08:02,517 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:08:02,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-15 21:08:02,731 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,SelfDestructingSolverStorable11 [2022-10-15 21:08:02,732 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:08:02,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:08:02,733 INFO L85 PathProgramCache]: Analyzing trace with hash 110166857, now seen corresponding path program 1 times [2022-10-15 21:08:02,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:08:02,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670162445] [2022-10-15 21:08:02,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:08:02,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:08:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:03,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:08:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:03,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-15 21:08:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:03,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:08:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:03,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:08:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:03,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:08:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:03,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:08:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:03,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-15 21:08:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:03,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-15 21:08:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:03,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-15 21:08:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:03,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-10-15 21:08:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:03,141 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-10-15 21:08:03,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:08:03,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670162445] [2022-10-15 21:08:03,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670162445] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:08:03,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733469412] [2022-10-15 21:08:03,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:08:03,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:08:03,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:08:03,146 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-15 21:08:03,171 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-15 21:08:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:03,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 1646 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-15 21:08:03,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:08:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-10-15 21:08:03,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:08:03,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733469412] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:08:03,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:08:03,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-10-15 21:08:03,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786299647] [2022-10-15 21:08:03,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:08:03,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:08:03,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:08:03,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:08:03,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:08:03,977 INFO L87 Difference]: Start difference. First operand 1218 states and 1603 transitions. Second operand has 4 states, 3 states have (on average 25.0) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 21:08:04,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:08:04,217 INFO L93 Difference]: Finished difference Result 1379 states and 1814 transitions. [2022-10-15 21:08:04,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:08:04,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 25.0) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 137 [2022-10-15 21:08:04,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:08:04,227 INFO L225 Difference]: With dead ends: 1379 [2022-10-15 21:08:04,227 INFO L226 Difference]: Without dead ends: 1377 [2022-10-15 21:08:04,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 21:08:04,230 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 316 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:08:04,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 521 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:08:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2022-10-15 21:08:04,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1055. [2022-10-15 21:08:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 846 states have (on average 1.309692671394799) internal successors, (1108), 847 states have internal predecessors, (1108), 141 states have call successors, (141), 66 states have call predecessors, (141), 66 states have return successors, (141), 141 states have call predecessors, (141), 141 states have call successors, (141) [2022-10-15 21:08:04,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1390 transitions. [2022-10-15 21:08:04,370 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1390 transitions. Word has length 137 [2022-10-15 21:08:04,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:08:04,370 INFO L495 AbstractCegarLoop]: Abstraction has 1055 states and 1390 transitions. [2022-10-15 21:08:04,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 25.0) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 21:08:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1390 transitions. [2022-10-15 21:08:04,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-10-15 21:08:04,375 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:08:04,375 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2022-10-15 21:08:04,420 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-15 21:08:04,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:08:04,590 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:08:04,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:08:04,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1466913640, now seen corresponding path program 1 times [2022-10-15 21:08:04,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:08:04,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856685144] [2022-10-15 21:08:04,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:08:04,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:08:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:04,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:08:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:04,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-15 21:08:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:04,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:08:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:04,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:08:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:04,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:08:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:04,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:08:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:04,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-15 21:08:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:04,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-15 21:08:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:04,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-15 21:08:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:04,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-10-15 21:08:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:04,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-10-15 21:08:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-10-15 21:08:04,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:08:04,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856685144] [2022-10-15 21:08:04,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856685144] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:08:04,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:08:04,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 21:08:04,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879465897] [2022-10-15 21:08:04,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:08:04,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:08:04,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:08:04,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:08:04,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:08:04,988 INFO L87 Difference]: Start difference. First operand 1055 states and 1390 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-15 21:08:05,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:08:05,344 INFO L93 Difference]: Finished difference Result 1095 states and 1452 transitions. [2022-10-15 21:08:05,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:08:05,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 140 [2022-10-15 21:08:05,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:08:05,354 INFO L225 Difference]: With dead ends: 1095 [2022-10-15 21:08:05,355 INFO L226 Difference]: Without dead ends: 1094 [2022-10-15 21:08:05,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:08:05,357 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 26 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 21:08:05,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 497 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 21:08:05,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2022-10-15 21:08:05,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1046. [2022-10-15 21:08:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 840 states have (on average 1.3095238095238095) internal successors, (1100), 840 states have internal predecessors, (1100), 139 states have call successors, (139), 66 states have call predecessors, (139), 66 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) [2022-10-15 21:08:05,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1378 transitions. [2022-10-15 21:08:05,482 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1378 transitions. Word has length 140 [2022-10-15 21:08:05,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:08:05,483 INFO L495 AbstractCegarLoop]: Abstraction has 1046 states and 1378 transitions. [2022-10-15 21:08:05,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-15 21:08:05,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1378 transitions. [2022-10-15 21:08:05,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-10-15 21:08:05,492 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:08:05,492 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:08:05,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 21:08:05,492 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:08:05,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:08:05,493 INFO L85 PathProgramCache]: Analyzing trace with hash 427362110, now seen corresponding path program 1 times [2022-10-15 21:08:05,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:08:05,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030351679] [2022-10-15 21:08:05,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:08:05,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:08:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:05,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:08:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:05,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-15 21:08:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:05,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:08:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:05,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:08:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:05,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:08:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:05,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:08:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:05,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-15 21:08:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:05,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-10-15 21:08:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:05,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-10-15 21:08:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:05,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-10-15 21:08:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:05,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-10-15 21:08:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:05,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-10-15 21:08:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:05,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-10-15 21:08:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:05,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-10-15 21:08:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:05,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-10-15 21:08:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:06,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-10-15 21:08:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:06,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-10-15 21:08:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:06,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-10-15 21:08:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:06,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-10-15 21:08:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:06,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-10-15 21:08:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:06,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-10-15 21:08:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:06,051 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2022-10-15 21:08:06,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:08:06,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030351679] [2022-10-15 21:08:06,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030351679] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:08:06,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:08:06,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:08:06,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547479613] [2022-10-15 21:08:06,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:08:06,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:08:06,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:08:06,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:08:06,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:08:06,056 INFO L87 Difference]: Start difference. First operand 1046 states and 1378 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-15 21:08:06,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:08:06,818 INFO L93 Difference]: Finished difference Result 1819 states and 2401 transitions. [2022-10-15 21:08:06,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:08:06,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 271 [2022-10-15 21:08:06,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:08:06,825 INFO L225 Difference]: With dead ends: 1819 [2022-10-15 21:08:06,826 INFO L226 Difference]: Without dead ends: 876 [2022-10-15 21:08:06,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:08:06,831 INFO L413 NwaCegarLoop]: 339 mSDtfsCounter, 169 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 21:08:06,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 711 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 21:08:06,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2022-10-15 21:08:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 846. [2022-10-15 21:08:06,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 684 states have (on average 1.2894736842105263) internal successors, (882), 684 states have internal predecessors, (882), 111 states have call successors, (111), 50 states have call predecessors, (111), 50 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2022-10-15 21:08:06,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1104 transitions. [2022-10-15 21:08:06,942 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1104 transitions. Word has length 271 [2022-10-15 21:08:06,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:08:06,943 INFO L495 AbstractCegarLoop]: Abstraction has 846 states and 1104 transitions. [2022-10-15 21:08:06,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-15 21:08:06,943 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1104 transitions. [2022-10-15 21:08:06,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-10-15 21:08:06,951 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:08:06,951 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 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, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-10-15 21:08:06,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 21:08:06,952 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2022-10-15 21:08:06,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:08:06,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2126177888, now seen corresponding path program 2 times [2022-10-15 21:08:06,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:08:06,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016316049] [2022-10-15 21:08:06,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:08:06,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:08:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 21:08:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-15 21:08:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-15 21:08:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-15 21:08:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 21:08:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-15 21:08:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-15 21:08:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-10-15 21:08:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-10-15 21:08:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-10-15 21:08:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-10-15 21:08:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-10-15 21:08:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-10-15 21:08:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-10-15 21:08:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-10-15 21:08:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-10-15 21:08:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-10-15 21:08:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-10-15 21:08:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-10-15 21:08:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2022-10-15 21:08:07,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-10-15 21:08:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:08:07,519 INFO L134 CoverageAnalysis]: Checked inductivity of 982 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2022-10-15 21:08:07,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:08:07,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016316049] [2022-10-15 21:08:07,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016316049] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:08:07,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:08:07,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:08:07,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462171790] [2022-10-15 21:08:07,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:08:07,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:08:07,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:08:07,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:08:07,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:08:07,523 INFO L87 Difference]: Start difference. First operand 846 states and 1104 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-15 21:08:07,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:08:07,895 INFO L93 Difference]: Finished difference Result 1145 states and 1497 transitions. [2022-10-15 21:08:07,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 21:08:07,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 293 [2022-10-15 21:08:07,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:08:07,896 INFO L225 Difference]: With dead ends: 1145 [2022-10-15 21:08:07,897 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 21:08:07,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:08:07,900 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 167 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 21:08:07,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 634 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 21:08:07,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 21:08:07,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 21:08:07,901 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-15 21:08:07,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 21:08:07,902 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 293 [2022-10-15 21:08:07,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:08:07,902 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 21:08:07,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-15 21:08:07,903 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 21:08:07,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 21:08:07,908 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2022-10-15 21:08:07,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2022-10-15 21:08:07,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2022-10-15 21:08:07,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2022-10-15 21:08:07,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2022-10-15 21:08:07,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2022-10-15 21:08:07,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2022-10-15 21:08:07,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2022-10-15 21:08:07,910 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2022-10-15 21:08:07,911 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2022-10-15 21:08:07,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-15 21:08:07,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-15 21:08:11,395 INFO L899 garLoopResultBuilder]: For program point L2945(lines 2945 2948) no Hoare annotation was computed. [2022-10-15 21:08:11,396 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_lock_mtx_of_isl_pmicEXIT(lines 2942 2952) no Hoare annotation was computed. [2022-10-15 21:08:11,396 INFO L899 garLoopResultBuilder]: For program point L2947-1(lines 2945 2948) no Hoare annotation was computed. [2022-10-15 21:08:11,396 INFO L902 garLoopResultBuilder]: At program point ldv_mutex_lock_mtx_of_isl_pmicENTRY(lines 2942 2952) the Hoare annotation is: true [2022-10-15 21:08:11,396 INFO L902 garLoopResultBuilder]: At program point L2947(line 2947) the Hoare annotation is: true [2022-10-15 21:08:11,397 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_lock_mtx_of_isl_pmicFINAL(lines 2942 2952) no Hoare annotation was computed. [2022-10-15 21:08:11,397 INFO L902 garLoopResultBuilder]: At program point ldv_mutex_unlock_mtx_of_isl_pmicENTRY(lines 3000 3010) the Hoare annotation is: true [2022-10-15 21:08:11,397 INFO L899 garLoopResultBuilder]: For program point L3005-1(lines 3003 3006) no Hoare annotation was computed. [2022-10-15 21:08:11,397 INFO L902 garLoopResultBuilder]: At program point L3005(line 3005) the Hoare annotation is: true [2022-10-15 21:08:11,398 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_unlock_mtx_of_isl_pmicEXIT(lines 3000 3010) no Hoare annotation was computed. [2022-10-15 21:08:11,398 INFO L899 garLoopResultBuilder]: For program point L3003(lines 3003 3006) no Hoare annotation was computed. [2022-10-15 21:08:11,398 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_unlock_mtx_of_isl_pmicFINAL(lines 3000 3010) no Hoare annotation was computed. [2022-10-15 21:08:11,398 INFO L899 garLoopResultBuilder]: For program point regulator_list_voltage_linearFINAL(lines 3204 3206) no Hoare annotation was computed. [2022-10-15 21:08:11,398 INFO L899 garLoopResultBuilder]: For program point regulator_list_voltage_linearEXIT(lines 3204 3206) no Hoare annotation was computed. [2022-10-15 21:08:11,398 INFO L902 garLoopResultBuilder]: At program point regulator_list_voltage_linearENTRY(lines 3204 3206) the Hoare annotation is: true [2022-10-15 21:08:11,398 INFO L902 garLoopResultBuilder]: At program point mutex_unlockENTRY(lines 3197 3199) the Hoare annotation is: true [2022-10-15 21:08:11,399 INFO L899 garLoopResultBuilder]: For program point mutex_unlockEXIT(lines 3197 3199) no Hoare annotation was computed. [2022-10-15 21:08:11,399 INFO L899 garLoopResultBuilder]: For program point mutex_unlockFINAL(lines 3197 3199) no Hoare annotation was computed. [2022-10-15 21:08:11,399 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 3158 3164) the Hoare annotation is: (let ((.cse2 (not (<= 0 ~ref_cnt~0))) (.cse0 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse1 (not (= ~ldv_state_variable_0~0 3))) (.cse3 (not (<= ~ref_cnt~0 0)))) (and (or (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) .cse0 .cse1 (not (<= ~ref_cnt~0 1))) (or (not (= ~ldv_state_variable_1~0 0)) .cse2 .cse0 .cse3) (or .cse2 (not (= ~ldv_state_variable_1~0 1)) .cse0 .cse1 .cse3))) [2022-10-15 21:08:11,399 INFO L902 garLoopResultBuilder]: At program point L3162(line 3162) the Hoare annotation is: true [2022-10-15 21:08:11,399 INFO L899 garLoopResultBuilder]: For program point L3160(line 3160) no Hoare annotation was computed. [2022-10-15 21:08:11,400 INFO L899 garLoopResultBuilder]: For program point L3162-1(line 3162) no Hoare annotation was computed. [2022-10-15 21:08:11,400 INFO L899 garLoopResultBuilder]: For program point L3156(line 3156) no Hoare annotation was computed. [2022-10-15 21:08:11,400 INFO L899 garLoopResultBuilder]: For program point L3155(lines 3155 3157) no Hoare annotation was computed. [2022-10-15 21:08:11,400 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 3158 3164) no Hoare annotation was computed. [2022-10-15 21:08:11,400 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 3158 3164) no Hoare annotation was computed. [2022-10-15 21:08:11,400 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 2684 2689) no Hoare annotation was computed. [2022-10-15 21:08:11,400 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 2684 2689) the Hoare annotation is: true [2022-10-15 21:08:11,401 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2684 2689) no Hoare annotation was computed. [2022-10-15 21:08:11,401 INFO L902 garLoopResultBuilder]: At program point regulator_unregisterENTRY(lines 3214 3216) the Hoare annotation is: true [2022-10-15 21:08:11,401 INFO L899 garLoopResultBuilder]: For program point regulator_unregisterFINAL(lines 3214 3216) no Hoare annotation was computed. [2022-10-15 21:08:11,401 INFO L899 garLoopResultBuilder]: For program point regulator_unregisterEXIT(lines 3214 3216) no Hoare annotation was computed. [2022-10-15 21:08:11,401 INFO L902 garLoopResultBuilder]: At program point mutex_lockENTRY(lines 3190 3192) the Hoare annotation is: true [2022-10-15 21:08:11,401 INFO L899 garLoopResultBuilder]: For program point mutex_lockFINAL(lines 3190 3192) no Hoare annotation was computed. [2022-10-15 21:08:11,401 INFO L899 garLoopResultBuilder]: For program point mutex_lockEXIT(lines 3190 3192) no Hoare annotation was computed. [2022-10-15 21:08:11,402 INFO L899 garLoopResultBuilder]: For program point L2529(lines 2529 2533) no Hoare annotation was computed. [2022-10-15 21:08:11,402 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2368) no Hoare annotation was computed. [2022-10-15 21:08:11,402 INFO L895 garLoopResultBuilder]: At program point L2397(lines 2378 2399) the Hoare annotation is: (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 0 |ULTIMATE.start_isl6271a_remove_~i~1#1|) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:08:11,402 INFO L895 garLoopResultBuilder]: At program point L2678(line 2678) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,403 INFO L895 garLoopResultBuilder]: At program point L2678-1(line 2678) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,403 INFO L899 garLoopResultBuilder]: For program point L2480(line 2480) no Hoare annotation was computed. [2022-10-15 21:08:11,403 INFO L895 garLoopResultBuilder]: At program point L2249(lines 2245 2251) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:08:11,403 INFO L895 garLoopResultBuilder]: At program point L2662(line 2662) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,404 INFO L895 garLoopResultBuilder]: At program point L2662-1(line 2662) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,404 INFO L895 garLoopResultBuilder]: At program point L2530(line 2530) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,404 INFO L899 garLoopResultBuilder]: For program point L2563(line 2563) no Hoare annotation was computed. [2022-10-15 21:08:11,404 INFO L899 garLoopResultBuilder]: For program point L2464(lines 2464 2468) no Hoare annotation was computed. [2022-10-15 21:08:11,404 INFO L899 garLoopResultBuilder]: For program point L2530-1(line 2530) no Hoare annotation was computed. [2022-10-15 21:08:11,404 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-15 21:08:11,405 INFO L895 garLoopResultBuilder]: At program point L2266(lines 2252 2268) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,405 INFO L895 garLoopResultBuilder]: At program point L2233(lines 2229 2235) the Hoare annotation is: (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:08:11,405 INFO L895 garLoopResultBuilder]: At program point L2679(lines 2675 2682) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,405 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2476) no Hoare annotation was computed. [2022-10-15 21:08:11,405 INFO L895 garLoopResultBuilder]: At program point L2283(lines 2269 2285) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,406 INFO L895 garLoopResultBuilder]: At program point L2663(lines 2659 2666) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,406 INFO L899 garLoopResultBuilder]: For program point L2564(lines 2564 2579) no Hoare annotation was computed. [2022-10-15 21:08:11,406 INFO L895 garLoopResultBuilder]: At program point L2366(line 2366) the Hoare annotation is: false [2022-10-15 21:08:11,406 INFO L899 garLoopResultBuilder]: For program point L2366-1(line 2366) no Hoare annotation was computed. [2022-10-15 21:08:11,406 INFO L899 garLoopResultBuilder]: For program point L3126(lines 3126 3129) no Hoare annotation was computed. [2022-10-15 21:08:11,406 INFO L899 garLoopResultBuilder]: For program point L2581(line 2581) no Hoare annotation was computed. [2022-10-15 21:08:11,406 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2476) no Hoare annotation was computed. [2022-10-15 21:08:11,407 INFO L902 garLoopResultBuilder]: At program point L3176(lines 3175 3177) the Hoare annotation is: true [2022-10-15 21:08:11,407 INFO L895 garLoopResultBuilder]: At program point L3209(lines 3208 3210) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,407 INFO L899 garLoopResultBuilder]: For program point L2466(line 2466) no Hoare annotation was computed. [2022-10-15 21:08:11,407 INFO L899 garLoopResultBuilder]: For program point L2499(line 2499) no Hoare annotation was computed. [2022-10-15 21:08:11,407 INFO L899 garLoopResultBuilder]: For program point L2466-1(line 2466) no Hoare annotation was computed. [2022-10-15 21:08:11,407 INFO L895 garLoopResultBuilder]: At program point L2367(lines 2310 2376) the Hoare annotation is: false [2022-10-15 21:08:11,408 INFO L895 garLoopResultBuilder]: At program point L2169(lines 2166 2171) the Hoare annotation is: false [2022-10-15 21:08:11,408 INFO L899 garLoopResultBuilder]: For program point L2549(line 2549) no Hoare annotation was computed. [2022-10-15 21:08:11,408 INFO L899 garLoopResultBuilder]: For program point L2566(lines 2566 2576) no Hoare annotation was computed. [2022-10-15 21:08:11,408 INFO L899 garLoopResultBuilder]: For program point L2500(lines 2500 2515) no Hoare annotation was computed. [2022-10-15 21:08:11,408 INFO L899 garLoopResultBuilder]: For program point L2368(line 2368) no Hoare annotation was computed. [2022-10-15 21:08:11,408 INFO L902 garLoopResultBuilder]: At program point L3128(line 3128) the Hoare annotation is: true [2022-10-15 21:08:11,408 INFO L899 garLoopResultBuilder]: For program point L2550(lines 2550 2554) no Hoare annotation was computed. [2022-10-15 21:08:11,408 INFO L899 garLoopResultBuilder]: For program point L3128-1(lines 3125 3143) no Hoare annotation was computed. [2022-10-15 21:08:11,409 INFO L899 garLoopResultBuilder]: For program point L2517(line 2517) no Hoare annotation was computed. [2022-10-15 21:08:11,409 INFO L895 garLoopResultBuilder]: At program point L2418(lines 2414 2420) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)) [2022-10-15 21:08:11,409 INFO L899 garLoopResultBuilder]: For program point L2567(line 2567) no Hoare annotation was computed. [2022-10-15 21:08:11,409 INFO L899 garLoopResultBuilder]: For program point L2369(lines 2369 2373) no Hoare annotation was computed. [2022-10-15 21:08:11,409 INFO L895 garLoopResultBuilder]: At program point L2584(lines 2447 2589) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,409 INFO L899 garLoopResultBuilder]: For program point L2353-1(line 2353) no Hoare annotation was computed. [2022-10-15 21:08:11,409 INFO L899 garLoopResultBuilder]: For program point L2353(line 2353) no Hoare annotation was computed. [2022-10-15 21:08:11,410 INFO L895 garLoopResultBuilder]: At program point L3212(line 3212) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (let ((.cse0 (= ~ldv_state_variable_1~0 1))) (or (and (= |ULTIMATE.start_isl6271a_probe_~i~0#1| 0) .cse0) (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= |ULTIMATE.start_isl6271a_probe_~i~0#1| 2) .cse0))) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:08:11,410 INFO L895 garLoopResultBuilder]: At program point L3146(lines 3145 3147) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:08:11,410 INFO L895 garLoopResultBuilder]: At program point L3212-2(lines 3211 3213) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (let ((.cse0 (= ~ldv_state_variable_1~0 1))) (or (and (= |ULTIMATE.start_isl6271a_probe_~i~0#1| 0) .cse0) (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= |ULTIMATE.start_isl6271a_probe_~i~0#1| 2) .cse0))) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:08:11,410 INFO L899 garLoopResultBuilder]: For program point L3212-1(line 3212) no Hoare annotation was computed. [2022-10-15 21:08:11,410 INFO L899 garLoopResultBuilder]: For program point L2568(lines 2568 2572) no Hoare annotation was computed. [2022-10-15 21:08:11,410 INFO L899 garLoopResultBuilder]: For program point L2502(lines 2502 2508) no Hoare annotation was computed. [2022-10-15 21:08:11,411 INFO L899 garLoopResultBuilder]: For program point L2535(line 2535) no Hoare annotation was computed. [2022-10-15 21:08:11,411 INFO L899 garLoopResultBuilder]: For program point L2502-2(lines 2500 2514) no Hoare annotation was computed. [2022-10-15 21:08:11,411 INFO L895 garLoopResultBuilder]: At program point L2370(lines 2310 2376) the Hoare annotation is: false [2022-10-15 21:08:11,411 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-15 21:08:11,411 INFO L899 garLoopResultBuilder]: For program point L2337(lines 2337 2341) no Hoare annotation was computed. [2022-10-15 21:08:11,411 INFO L899 garLoopResultBuilder]: For program point L2337-2(lines 2337 2341) no Hoare annotation was computed. [2022-10-15 21:08:11,411 INFO L895 garLoopResultBuilder]: At program point L2354(lines 2310 2376) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_1~0 1)) (.cse1 (= ~ref_cnt~0 0)) (.cse2 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_isl6271a_probe_~i~0#1| 0) .cse0 .cse1 .cse2))) [2022-10-15 21:08:11,412 INFO L899 garLoopResultBuilder]: For program point L2321(lines 2321 2324) no Hoare annotation was computed. [2022-10-15 21:08:11,412 INFO L895 garLoopResultBuilder]: At program point L3180(lines 3179 3181) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)) [2022-10-15 21:08:11,412 INFO L899 garLoopResultBuilder]: For program point L2536(lines 2536 2540) no Hoare annotation was computed. [2022-10-15 21:08:11,412 INFO L899 garLoopResultBuilder]: For program point L2569-1(line 2569) no Hoare annotation was computed. [2022-10-15 21:08:11,412 INFO L895 garLoopResultBuilder]: At program point L2569(line 2569) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,412 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2368) no Hoare annotation was computed. [2022-10-15 21:08:11,413 INFO L899 garLoopResultBuilder]: For program point L2487(line 2487) no Hoare annotation was computed. [2022-10-15 21:08:11,413 INFO L895 garLoopResultBuilder]: At program point L2388(line 2388) the Hoare annotation is: (and (<= |ULTIMATE.start_isl6271a_remove_~i~1#1| 2) (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 0 |ULTIMATE.start_isl6271a_remove_~i~1#1|) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:08:11,413 INFO L899 garLoopResultBuilder]: For program point L2388-1(line 2388) no Hoare annotation was computed. [2022-10-15 21:08:11,413 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2389) no Hoare annotation was computed. [2022-10-15 21:08:11,413 INFO L895 garLoopResultBuilder]: At program point L2372(lines 2310 2376) the Hoare annotation is: false [2022-10-15 21:08:11,413 INFO L902 garLoopResultBuilder]: At program point L3132(line 3132) the Hoare annotation is: true [2022-10-15 21:08:11,413 INFO L899 garLoopResultBuilder]: For program point L3132-1(lines 3125 3143) no Hoare annotation was computed. [2022-10-15 21:08:11,414 INFO L899 garLoopResultBuilder]: For program point L2488(lines 2488 2522) no Hoare annotation was computed. [2022-10-15 21:08:11,414 INFO L895 garLoopResultBuilder]: At program point L2356(lines 2310 2376) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_1~0 1)) (.cse1 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (<= ~ref_cnt~0 0) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= |ULTIMATE.start_isl6271a_probe_~i~0#1| 2) (<= 0 ~ref_cnt~0) .cse0 .cse1) (and (= |ULTIMATE.start_isl6271a_probe_~i~0#1| 0) .cse0 (= ~ref_cnt~0 0) .cse1))) [2022-10-15 21:08:11,414 INFO L899 garLoopResultBuilder]: For program point L2389-1(line 2389) no Hoare annotation was computed. [2022-10-15 21:08:11,414 INFO L899 garLoopResultBuilder]: For program point L2389(line 2389) no Hoare annotation was computed. [2022-10-15 21:08:11,414 INFO L899 garLoopResultBuilder]: For program point L2257-1(line 2257) no Hoare annotation was computed. [2022-10-15 21:08:11,414 INFO L895 garLoopResultBuilder]: At program point L2257(line 2257) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,414 INFO L895 garLoopResultBuilder]: At program point L2670(line 2670) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,415 INFO L895 garLoopResultBuilder]: At program point L2670-1(line 2670) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,415 INFO L899 garLoopResultBuilder]: For program point L2472(line 2472) no Hoare annotation was computed. [2022-10-15 21:08:11,415 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2389) no Hoare annotation was computed. [2022-10-15 21:08:11,415 INFO L895 garLoopResultBuilder]: At program point L2274(line 2274) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,415 INFO L899 garLoopResultBuilder]: For program point L2274-1(line 2274) no Hoare annotation was computed. [2022-10-15 21:08:11,415 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2353) no Hoare annotation was computed. [2022-10-15 21:08:11,416 INFO L895 garLoopResultBuilder]: At program point L3166(line 3166) the Hoare annotation is: (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:08:11,416 INFO L895 garLoopResultBuilder]: At program point L2654(line 2654) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,416 INFO L895 garLoopResultBuilder]: At program point L3166-2(lines 3165 3167) the Hoare annotation is: (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:08:11,416 INFO L902 garLoopResultBuilder]: At program point L2588(lines 2441 2590) the Hoare annotation is: true [2022-10-15 21:08:11,416 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-15 21:08:11,416 INFO L899 garLoopResultBuilder]: For program point L3166-1(line 3166) no Hoare annotation was computed. [2022-10-15 21:08:11,417 INFO L895 garLoopResultBuilder]: At program point L2654-1(line 2654) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,417 INFO L899 garLoopResultBuilder]: For program point L2456(lines 2456 2583) no Hoare annotation was computed. [2022-10-15 21:08:11,417 INFO L895 garLoopResultBuilder]: At program point L2390(lines 2382 2398) the Hoare annotation is: (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 0 |ULTIMATE.start_isl6271a_remove_~i~1#1|) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:08:11,417 INFO L895 garLoopResultBuilder]: At program point L2671(lines 2667 2674) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,417 INFO L899 garLoopResultBuilder]: For program point L2473(lines 2473 2478) no Hoare annotation was computed. [2022-10-15 21:08:11,417 INFO L895 garLoopResultBuilder]: At program point L2242(lines 2238 2244) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:08:11,417 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2353) no Hoare annotation was computed. [2022-10-15 21:08:11,418 INFO L895 garLoopResultBuilder]: At program point L2655(lines 2651 2658) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,418 INFO L899 garLoopResultBuilder]: For program point L2556(line 2556) no Hoare annotation was computed. [2022-10-15 21:08:11,418 INFO L899 garLoopResultBuilder]: For program point L2490(lines 2490 2519) no Hoare annotation was computed. [2022-10-15 21:08:11,418 INFO L899 garLoopResultBuilder]: For program point L2457(line 2457) no Hoare annotation was computed. [2022-10-15 21:08:11,418 INFO L895 garLoopResultBuilder]: At program point L2358(lines 2310 2376) the Hoare annotation is: (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:08:11,418 INFO L895 garLoopResultBuilder]: At program point L2226(lines 2222 2228) the Hoare annotation is: (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:08:11,419 INFO L895 garLoopResultBuilder]: At program point L3184(lines 3183 3185) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,419 INFO L895 garLoopResultBuilder]: At program point L2375(lines 2299 2377) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_1~0 1)) (.cse1 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) .cse0 (= ~ref_cnt~0 0) .cse1) (and (<= ~ref_cnt~0 0) (<= (+ |ULTIMATE.start_isl6271a_probe_#res#1| 5) 0) (<= 0 ~ref_cnt~0) .cse0 .cse1))) [2022-10-15 21:08:11,419 INFO L899 garLoopResultBuilder]: For program point L2524(line 2524) no Hoare annotation was computed. [2022-10-15 21:08:11,419 INFO L899 garLoopResultBuilder]: For program point L2458(lines 2458 2485) no Hoare annotation was computed. [2022-10-15 21:08:11,419 INFO L899 garLoopResultBuilder]: For program point L2491(line 2491) no Hoare annotation was computed. [2022-10-15 21:08:11,419 INFO L895 garLoopResultBuilder]: At program point L2392(lines 2382 2398) the Hoare annotation is: (and (<= |ULTIMATE.start_isl6271a_remove_~i~1#1| 2) (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 0 |ULTIMATE.start_isl6271a_remove_~i~1#1|) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:08:11,419 INFO L902 garLoopResultBuilder]: At program point L2425(lines 2421 2427) the Hoare annotation is: true [2022-10-15 21:08:11,419 INFO L899 garLoopResultBuilder]: For program point L2574(line 2574) no Hoare annotation was computed. [2022-10-15 21:08:11,420 INFO L902 garLoopResultBuilder]: At program point L3136(line 3136) the Hoare annotation is: true [2022-10-15 21:08:11,420 INFO L899 garLoopResultBuilder]: For program point L3136-1(lines 3125 3143) no Hoare annotation was computed. [2022-10-15 21:08:11,420 INFO L899 garLoopResultBuilder]: For program point L2492(lines 2492 2497) no Hoare annotation was computed. [2022-10-15 21:08:11,420 INFO L899 garLoopResultBuilder]: For program point L2525(lines 2525 2561) no Hoare annotation was computed. [2022-10-15 21:08:11,420 INFO L899 garLoopResultBuilder]: For program point L2327(lines 2327 2330) no Hoare annotation was computed. [2022-10-15 21:08:11,420 INFO L899 garLoopResultBuilder]: For program point L2261(lines 2261 2264) no Hoare annotation was computed. [2022-10-15 21:08:11,420 INFO L899 garLoopResultBuilder]: For program point L2261-2(lines 2261 2264) no Hoare annotation was computed. [2022-10-15 21:08:11,420 INFO L895 garLoopResultBuilder]: At program point L3120(lines 3113 3122) the Hoare annotation is: (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)) [2022-10-15 21:08:11,420 INFO L899 garLoopResultBuilder]: For program point L2542(line 2542) no Hoare annotation was computed. [2022-10-15 21:08:11,421 INFO L899 garLoopResultBuilder]: For program point L2476(line 2476) no Hoare annotation was computed. [2022-10-15 21:08:11,421 INFO L899 garLoopResultBuilder]: For program point L2476-1(line 2476) no Hoare annotation was computed. [2022-10-15 21:08:11,421 INFO L899 garLoopResultBuilder]: For program point L2278(lines 2278 2281) no Hoare annotation was computed. [2022-10-15 21:08:11,421 INFO L899 garLoopResultBuilder]: For program point L2278-2(lines 2278 2281) no Hoare annotation was computed. [2022-10-15 21:08:11,421 INFO L895 garLoopResultBuilder]: At program point L3170(lines 3169 3171) the Hoare annotation is: (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:08:11,421 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-15 21:08:11,421 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2022-10-15 21:08:11,421 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2466) no Hoare annotation was computed. [2022-10-15 21:08:11,422 INFO L899 garLoopResultBuilder]: For program point L2460(lines 2460 2482) no Hoare annotation was computed. [2022-10-15 21:08:11,422 INFO L895 garLoopResultBuilder]: At program point L2394(lines 2382 2398) the Hoare annotation is: (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 0 |ULTIMATE.start_isl6271a_remove_~i~1#1|) (<= 1 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3) (<= ~ref_cnt~0 1)) [2022-10-15 21:08:11,422 INFO L899 garLoopResultBuilder]: For program point L2543(lines 2543 2547) no Hoare annotation was computed. [2022-10-15 21:08:11,422 INFO L899 garLoopResultBuilder]: For program point L2345-1(line 2345) no Hoare annotation was computed. [2022-10-15 21:08:11,422 INFO L895 garLoopResultBuilder]: At program point L2345(line 2345) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (let ((.cse0 (= ~ldv_state_variable_1~0 1))) (or (and (= |ULTIMATE.start_isl6271a_probe_~i~0#1| 0) .cse0) (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= |ULTIMATE.start_isl6271a_probe_~i~0#1| 2) .cse0))) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:08:11,422 INFO L899 garLoopResultBuilder]: For program point L2527(lines 2527 2558) no Hoare annotation was computed. [2022-10-15 21:08:11,422 INFO L899 garLoopResultBuilder]: For program point L2461(line 2461) no Hoare annotation was computed. [2022-10-15 21:08:11,423 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2466) no Hoare annotation was computed. [2022-10-15 21:08:11,423 INFO L895 garLoopResultBuilder]: At program point L3188(lines 3187 3189) the Hoare annotation is: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= |ULTIMATE.start_isl6271a_probe_~tmp___2~0#1| 0) (= ~ldv_state_variable_1~0 2) (<= 1 |ULTIMATE.start_isl6271a_probe_~i~0#1|) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) [2022-10-15 21:08:11,423 INFO L902 garLoopResultBuilder]: At program point L2511(lines 2447 2589) the Hoare annotation is: true [2022-10-15 21:08:11,423 INFO L899 garLoopResultBuilder]: For program point L2346(lines 2346 2352) no Hoare annotation was computed. [2022-10-15 21:08:11,423 INFO L899 garLoopResultBuilder]: For program point L2528(line 2528) no Hoare annotation was computed. [2022-10-15 21:08:11,423 INFO L899 garLoopResultBuilder]: For program point L2462(lines 2462 2470) no Hoare annotation was computed. [2022-10-15 21:08:11,423 INFO L899 garLoopResultBuilder]: For program point L3173-1(line 3173) no Hoare annotation was computed. [2022-10-15 21:08:11,424 INFO L902 garLoopResultBuilder]: At program point L3140(line 3140) the Hoare annotation is: true [2022-10-15 21:08:11,424 INFO L895 garLoopResultBuilder]: At program point L3173(line 3173) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:08:11,424 INFO L895 garLoopResultBuilder]: At program point L3173-2(lines 3172 3174) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) (= ~ldv_state_variable_0~0 3)) [2022-10-15 21:08:11,424 INFO L902 garLoopResultBuilder]: At program point L3140-1(lines 3123 3144) the Hoare annotation is: true [2022-10-15 21:08:11,424 INFO L899 garLoopResultBuilder]: For program point L3201-1(line 3201) no Hoare annotation was computed. [2022-10-15 21:08:11,424 INFO L899 garLoopResultBuilder]: For program point rdev_get_drvdataEXIT(lines 3200 3202) no Hoare annotation was computed. [2022-10-15 21:08:11,425 INFO L895 garLoopResultBuilder]: At program point L3201(line 3201) the Hoare annotation is: (let ((.cse2 (not (<= 0 ~ref_cnt~0))) (.cse0 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse1 (not (= ~ldv_state_variable_0~0 3))) (.cse3 (not (<= ~ref_cnt~0 0)))) (and (or (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) .cse0 .cse1 (not (<= ~ref_cnt~0 1))) (or (not (= ~ldv_state_variable_1~0 0)) .cse2 .cse0 .cse3) (or .cse2 (not (= ~ldv_state_variable_1~0 1)) .cse0 .cse1 .cse3))) [2022-10-15 21:08:11,425 INFO L899 garLoopResultBuilder]: For program point rdev_get_drvdataFINAL(lines 3200 3202) no Hoare annotation was computed. [2022-10-15 21:08:11,425 INFO L895 garLoopResultBuilder]: At program point rdev_get_drvdataENTRY(lines 3200 3202) the Hoare annotation is: (let ((.cse2 (not (<= 0 ~ref_cnt~0))) (.cse0 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse1 (not (= ~ldv_state_variable_0~0 3))) (.cse3 (not (<= ~ref_cnt~0 0)))) (and (or (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) .cse0 .cse1 (not (<= ~ref_cnt~0 1))) (or (not (= ~ldv_state_variable_1~0 0)) .cse2 .cse0 .cse3) (or .cse2 (not (= ~ldv_state_variable_1~0 1)) .cse0 .cse1 .cse3))) [2022-10-15 21:08:11,425 INFO L902 garLoopResultBuilder]: At program point IS_ERRENTRY(lines 2172 2178) the Hoare annotation is: true [2022-10-15 21:08:11,425 INFO L899 garLoopResultBuilder]: For program point IS_ERRFINAL(lines 2172 2178) no Hoare annotation was computed. [2022-10-15 21:08:11,426 INFO L895 garLoopResultBuilder]: At program point L2694(lines 2691 2696) the Hoare annotation is: (let ((.cse0 (= |IS_ERR_ldv__builtin_expect_#res#1| 0)) (.cse2 (not (<= 0 ~ref_cnt~0))) (.cse1 (not (= ~ldv_state_variable_0~0 3))) (.cse3 (not (<= ~ref_cnt~0 0)))) (and (or (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) .cse0 .cse1 (not (<= ~ref_cnt~0 1))) (or (not (= ~ldv_state_variable_1~0 0)) .cse0 .cse2 .cse3) (or .cse0 .cse2 (not (= ~ldv_state_variable_1~0 1)) .cse1 .cse3))) [2022-10-15 21:08:11,426 INFO L899 garLoopResultBuilder]: For program point IS_ERREXIT(lines 2172 2178) no Hoare annotation was computed. [2022-10-15 21:08:11,430 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:08:11,433 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 21:08:11,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:08:11 BoogieIcfgContainer [2022-10-15 21:08:11,489 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 21:08:11,490 INFO L158 Benchmark]: Toolchain (without parser) took 27329.01ms. Allocated memory was 154.1MB in the beginning and 429.9MB in the end (delta: 275.8MB). Free memory was 124.5MB in the beginning and 274.9MB in the end (delta: -150.3MB). Peak memory consumption was 260.8MB. Max. memory is 8.0GB. [2022-10-15 21:08:11,490 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 154.1MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 21:08:11,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1199.57ms. Allocated memory is still 154.1MB. Free memory was 124.3MB in the beginning and 102.5MB in the end (delta: 21.8MB). Peak memory consumption was 34.7MB. Max. memory is 8.0GB. [2022-10-15 21:08:11,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.15ms. Allocated memory is still 154.1MB. Free memory was 102.5MB in the beginning and 96.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-15 21:08:11,494 INFO L158 Benchmark]: Boogie Preprocessor took 143.15ms. Allocated memory is still 154.1MB. Free memory was 96.2MB in the beginning and 91.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-10-15 21:08:11,495 INFO L158 Benchmark]: RCFGBuilder took 1373.27ms. Allocated memory was 154.1MB in the beginning and 199.2MB in the end (delta: 45.1MB). Free memory was 91.5MB in the beginning and 149.0MB in the end (delta: -57.5MB). Peak memory consumption was 55.8MB. Max. memory is 8.0GB. [2022-10-15 21:08:11,495 INFO L158 Benchmark]: TraceAbstraction took 24476.41ms. Allocated memory was 199.2MB in the beginning and 429.9MB in the end (delta: 230.7MB). Free memory was 147.9MB in the beginning and 274.9MB in the end (delta: -126.9MB). Peak memory consumption was 238.5MB. Max. memory is 8.0GB. [2022-10-15 21:08:11,500 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.27ms. Allocated memory is still 154.1MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1199.57ms. Allocated memory is still 154.1MB. Free memory was 124.3MB in the beginning and 102.5MB in the end (delta: 21.8MB). Peak memory consumption was 34.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 123.15ms. Allocated memory is still 154.1MB. Free memory was 102.5MB in the beginning and 96.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 143.15ms. Allocated memory is still 154.1MB. Free memory was 96.2MB in the beginning and 91.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1373.27ms. Allocated memory was 154.1MB in the beginning and 199.2MB in the end (delta: 45.1MB). Free memory was 91.5MB in the beginning and 149.0MB in the end (delta: -57.5MB). Peak memory consumption was 55.8MB. Max. memory is 8.0GB. * TraceAbstraction took 24476.41ms. Allocated memory was 199.2MB in the beginning and 429.9MB in the end (delta: 230.7MB). Free memory was 147.9MB in the beginning and 274.9MB in the end (delta: -126.9MB). Peak memory consumption was 238.5MB. 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: 2353]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2353]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2368]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2368]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2466]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2466]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2389]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2389]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2476]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 2476]: 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 11 procedures, 192 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 24.3s, OverallIterations: 16, TraceHistogramMax: 12, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3356 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3196 mSDsluCounter, 10856 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6274 mSDsCounter, 473 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1511 IncrementalHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 473 mSolverCounterUnsat, 4582 mSDtfsCounter, 1511 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1076 GetRequests, 1009 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1218occurred in iteration=12, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 1832 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 76 LocationsWithAnnotation, 1335 PreInvPairs, 1459 NumberOfFragments, 1670 HoareAnnotationTreeSize, 1335 FomulaSimplifications, 4993 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 76 FomulaSimplificationsInter, 7445 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 2171 NumberOfCodeBlocks, 2171 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2361 ConstructedInterpolants, 0 QuantifiedInterpolants, 4135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 8643 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 24 InterpolantComputations, 14 PerfectInterpolantSequences, 2783/2835 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 10 specifications checked. All of them hold - InvariantResult [Line: 2310]: Loop Invariant Derived loop invariant: (((tmp___2 == 0 && 1 <= i) && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2310]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2447]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2414]: Loop Invariant Derived loop invariant: ldv_state_variable_1 == 0 && ref_cnt == 0 - InvariantResult [Line: 2382]: Loop Invariant Derived loop invariant: (((((tmp___2 == 0 && ldv_state_variable_1 == 2) && 1 <= i) && 0 <= i) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 3211]: Loop Invariant Derived loop invariant: ((ref_cnt <= 0 && ((i == 0 && ldv_state_variable_1 == 1) || (((tmp___2 == 0 && 1 <= i) && i <= 2) && ldv_state_variable_1 == 1))) && 0 <= ref_cnt) && ldv_state_variable_0 == 3 - InvariantResult [Line: 3145]: Loop Invariant Derived loop invariant: ((ref_cnt <= 0 && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2691]: Loop Invariant Derived loop invariant: (((((!(ldv_state_variable_1 == 2) || !(1 <= ref_cnt)) || \result == 0) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 1)) && (((!(ldv_state_variable_1 == 0) || \result == 0) || !(0 <= ref_cnt)) || !(ref_cnt <= 0))) && ((((\result == 0 || !(0 <= ref_cnt)) || !(ldv_state_variable_1 == 1)) || !(ldv_state_variable_0 == 3)) || !(ref_cnt <= 0)) - InvariantResult [Line: 2382]: Loop Invariant Derived loop invariant: (((((tmp___2 == 0 && ldv_state_variable_1 == 2) && 1 <= i) && 0 <= i) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 2238]: Loop Invariant Derived loop invariant: ((ref_cnt <= 0 && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2245]: Loop Invariant Derived loop invariant: ((ref_cnt <= 0 && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2310]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2421]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2659]: Loop Invariant Derived loop invariant: ((((((tmp___2 == 0 && ldv_state_variable_1 == 2) && 1 <= i) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || (((ref_cnt <= 0 && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 2310]: Loop Invariant Derived loop invariant: ((((tmp___2 == 0 && 1 <= i) && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3) || (((i == 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 3113]: Loop Invariant Derived loop invariant: ldv_state_variable_1 == 0 && ref_cnt == 0 - InvariantResult [Line: 3175]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2299]: Loop Invariant Derived loop invariant: ((((tmp___2 == 0 && 1 <= i) && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3) || ((((ref_cnt <= 0 && \result + 5 <= 0) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3) - InvariantResult [Line: 2441]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3172]: Loop Invariant Derived loop invariant: ((ref_cnt <= 0 && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2310]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 2651]: Loop Invariant Derived loop invariant: ((((((tmp___2 == 0 && ldv_state_variable_1 == 2) && 1 <= i) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || (((ref_cnt <= 0 && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 2222]: Loop Invariant Derived loop invariant: ((((tmp___2 == 0 && ldv_state_variable_1 == 2) && 1 <= i) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 2252]: Loop Invariant Derived loop invariant: ((((((tmp___2 == 0 && ldv_state_variable_1 == 2) && 1 <= i) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || (((ref_cnt <= 0 && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 2166]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 3123]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3165]: Loop Invariant Derived loop invariant: ((((tmp___2 == 0 && ldv_state_variable_1 == 2) && 1 <= i) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 3169]: Loop Invariant Derived loop invariant: (((tmp___2 == 0 && 1 <= i) && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 2229]: Loop Invariant Derived loop invariant: (((tmp___2 == 0 && 1 <= i) && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3 - InvariantResult [Line: 3179]: Loop Invariant Derived loop invariant: ldv_state_variable_1 == 0 && ref_cnt == 0 - InvariantResult [Line: 2382]: Loop Invariant Derived loop invariant: ((((((i <= 2 && tmp___2 == 0) && ldv_state_variable_1 == 2) && 1 <= i) && 0 <= i) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 2269]: Loop Invariant Derived loop invariant: ((((((tmp___2 == 0 && ldv_state_variable_1 == 2) && 1 <= i) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || (((ref_cnt <= 0 && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 3187]: Loop Invariant Derived loop invariant: ((((((tmp___2 == 0 && ldv_state_variable_1 == 2) && 1 <= i) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || (((ref_cnt <= 0 && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 2447]: Loop Invariant Derived loop invariant: ((((((tmp___2 == 0 && ldv_state_variable_1 == 2) && 1 <= i) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || (((ref_cnt <= 0 && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 2310]: Loop Invariant Derived loop invariant: ((((((tmp___2 == 0 && ref_cnt <= 0) && 1 <= i) && i <= 2) && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3) || (((i == 0 && ldv_state_variable_1 == 1) && ref_cnt == 0) && ldv_state_variable_0 == 3) - InvariantResult [Line: 3208]: Loop Invariant Derived loop invariant: ((((((tmp___2 == 0 && ldv_state_variable_1 == 2) && 1 <= i) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || (((ref_cnt <= 0 && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 2378]: Loop Invariant Derived loop invariant: (((((tmp___2 == 0 && ldv_state_variable_1 == 2) && 1 <= i) && 0 <= i) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1 - InvariantResult [Line: 2667]: Loop Invariant Derived loop invariant: ((((((tmp___2 == 0 && ldv_state_variable_1 == 2) && 1 <= i) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || (((ref_cnt <= 0 && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 3183]: Loop Invariant Derived loop invariant: ((((((tmp___2 == 0 && ldv_state_variable_1 == 2) && 1 <= i) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || (((ref_cnt <= 0 && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) - InvariantResult [Line: 2675]: Loop Invariant Derived loop invariant: ((((((tmp___2 == 0 && ldv_state_variable_1 == 2) && 1 <= i) && 1 <= ref_cnt) && ldv_state_variable_0 == 3) && ref_cnt <= 1) || (((ref_cnt <= 0 && 0 <= ref_cnt) && ldv_state_variable_1 == 1) && ldv_state_variable_0 == 3)) || (ldv_state_variable_1 == 0 && ref_cnt == 0) RESULT: Ultimate proved your program to be correct! [2022-10-15 21:08:11,585 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...