/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-16 12:49:21,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 12:49:21,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 12:49:21,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 12:49:21,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 12:49:21,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 12:49:21,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 12:49:21,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 12:49:21,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 12:49:21,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 12:49:21,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 12:49:21,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 12:49:21,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 12:49:21,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 12:49:21,922 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 12:49:21,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 12:49:21,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 12:49:21,937 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 12:49:21,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 12:49:21,941 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 12:49:21,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 12:49:21,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 12:49:21,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 12:49:21,947 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 12:49:21,952 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 12:49:21,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 12:49:21,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 12:49:21,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 12:49:21,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 12:49:21,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 12:49:21,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 12:49:21,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 12:49:21,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 12:49:21,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 12:49:21,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 12:49:21,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 12:49:21,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 12:49:21,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 12:49:21,963 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 12:49:21,964 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 12:49:21,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 12:49:21,966 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 12:49:21,995 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 12:49:21,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 12:49:21,996 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 12:49:21,997 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 12:49:21,998 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 12:49:21,998 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 12:49:21,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 12:49:21,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 12:49:21,999 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 12:49:21,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 12:49:22,000 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 12:49:22,000 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 12:49:22,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 12:49:22,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 12:49:22,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 12:49:22,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 12:49:22,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 12:49:22,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 12:49:22,001 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 12:49:22,002 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 12:49:22,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 12:49:22,002 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 12:49:22,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 12:49:22,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 12:49:22,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 12:49:22,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 12:49:22,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:49:22,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 12:49:22,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 12:49:22,004 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 12:49:22,004 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 12:49:22,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 12:49:22,005 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 12:49:22,005 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-16 12:49:22,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 12:49:22,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 12:49:22,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 12:49:22,417 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 12:49:22,418 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 12:49:22,420 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-16 12:49:22,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be37798f3/5d26e27d5fe3465dbfd29a28b948d670/FLAGd0e0e4854 [2022-10-16 12:49:23,429 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 12:49:23,430 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-16 12:49:23,468 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be37798f3/5d26e27d5fe3465dbfd29a28b948d670/FLAGd0e0e4854 [2022-10-16 12:49:23,497 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be37798f3/5d26e27d5fe3465dbfd29a28b948d670 [2022-10-16 12:49:23,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 12:49:23,507 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 12:49:23,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 12:49:23,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 12:49:23,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 12:49:23,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:49:23" (1/1) ... [2022-10-16 12:49:23,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64080fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:23, skipping insertion in model container [2022-10-16 12:49:23,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:49:23" (1/1) ... [2022-10-16 12:49:23,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 12:49:23,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 12:49:24,300 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-16 12:49:24,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:49:24,418 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 12:49:24,561 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-16 12:49:24,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:49:24,688 INFO L208 MainTranslator]: Completed translation [2022-10-16 12:49:24,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:24 WrapperNode [2022-10-16 12:49:24,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 12:49:24,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 12:49:24,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 12:49:24,691 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 12:49:24,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:24" (1/1) ... [2022-10-16 12:49:24,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:24" (1/1) ... [2022-10-16 12:49:24,855 INFO L138 Inliner]: procedures = 99, calls = 345, calls flagged for inlining = 40, calls inlined = 32, statements flattened = 750 [2022-10-16 12:49:24,856 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 12:49:24,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 12:49:24,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 12:49:24,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 12:49:24,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:24" (1/1) ... [2022-10-16 12:49:24,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:24" (1/1) ... [2022-10-16 12:49:24,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:24" (1/1) ... [2022-10-16 12:49:24,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:24" (1/1) ... [2022-10-16 12:49:24,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:24" (1/1) ... [2022-10-16 12:49:24,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:24" (1/1) ... [2022-10-16 12:49:24,919 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:24" (1/1) ... [2022-10-16 12:49:24,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:24" (1/1) ... [2022-10-16 12:49:24,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 12:49:24,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 12:49:24,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 12:49:24,935 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 12:49:24,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:24" (1/1) ... [2022-10-16 12:49:24,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:49:24,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:49:24,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-16 12:49:24,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-16 12:49:25,044 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_list_voltage_linear [2022-10-16 12:49:25,045 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_list_voltage_linear [2022-10-16 12:49:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-16 12:49:25,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-16 12:49:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 12:49:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-10-16 12:49:25,046 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-10-16 12:49:25,046 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-10-16 12:49:25,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-10-16 12:49:25,046 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_unregister [2022-10-16 12:49:25,046 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_unregister [2022-10-16 12:49:25,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 12:49:25,047 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-10-16 12:49:25,047 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-10-16 12:49:25,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 12:49:25,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 12:49:25,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 12:49:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 12:49:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure rdev_get_drvdata [2022-10-16 12:49:25,048 INFO L138 BoogieDeclarations]: Found implementation of procedure rdev_get_drvdata [2022-10-16 12:49:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 12:49:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mtx_of_isl_pmic [2022-10-16 12:49:25,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mtx_of_isl_pmic [2022-10-16 12:49:25,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-16 12:49:25,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 12:49:25,049 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2022-10-16 12:49:25,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2022-10-16 12:49:25,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 12:49:25,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 12:49:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-10-16 12:49:25,050 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-10-16 12:49:25,317 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 12:49:25,322 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 12:49:26,375 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 12:49:26,386 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 12:49:26,386 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-16 12:49:26,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:49:26 BoogieIcfgContainer [2022-10-16 12:49:26,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 12:49:26,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 12:49:26,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 12:49:26,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 12:49:26,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:49:23" (1/3) ... [2022-10-16 12:49:26,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c3f087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:49:26, skipping insertion in model container [2022-10-16 12:49:26,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:49:24" (2/3) ... [2022-10-16 12:49:26,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c3f087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:49:26, skipping insertion in model container [2022-10-16 12:49:26,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:49:26" (3/3) ... [2022-10-16 12:49:26,400 INFO L112 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2022-10-16 12:49:26,423 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 12:49:26,423 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2022-10-16 12:49:26,494 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 12:49:26,504 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;@255be88a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 12:49:26,504 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-10-16 12:49:26,510 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-16 12:49:26,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-16 12:49:26,525 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:49:26,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:49:26,527 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-16 12:49:26,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:49:26,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1444456607, now seen corresponding path program 1 times [2022-10-16 12:49:26,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:49:26,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910389742] [2022-10-16 12:49:26,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:26,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:49:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 12:49:27,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:49:27,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910389742] [2022-10-16 12:49:27,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910389742] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:49:27,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:49:27,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:49:27,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642170066] [2022-10-16 12:49:27,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:49:27,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:49:27,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:49:27,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:49:27,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:49:27,205 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-16 12:49:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:49:27,464 INFO L93 Difference]: Finished difference Result 497 states and 696 transitions. [2022-10-16 12:49:27,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:49:27,468 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-16 12:49:27,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:49:27,492 INFO L225 Difference]: With dead ends: 497 [2022-10-16 12:49:27,492 INFO L226 Difference]: Without dead ends: 272 [2022-10-16 12:49:27,503 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-16 12:49:27,511 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-16 12:49:27,514 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-16 12:49:27,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-10-16 12:49:27,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2022-10-16 12:49:27,604 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-16 12:49:27,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 359 transitions. [2022-10-16 12:49:27,611 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 359 transitions. Word has length 15 [2022-10-16 12:49:27,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:49:27,611 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 359 transitions. [2022-10-16 12:49:27,612 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-16 12:49:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 359 transitions. [2022-10-16 12:49:27,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-10-16 12:49:27,616 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:49:27,616 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-16 12:49:27,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 12:49:27,617 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-16 12:49:27,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:49:27,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2072638708, now seen corresponding path program 1 times [2022-10-16 12:49:27,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:49:27,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206575149] [2022-10-16 12:49:27,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:27,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:49:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:27,969 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-16 12:49:27,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:49:27,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206575149] [2022-10-16 12:49:27,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206575149] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:49:27,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:49:27,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 12:49:27,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446487637] [2022-10-16 12:49:27,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:49:27,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:49:27,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:49:27,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:49:27,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 12:49:27,979 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-16 12:49:28,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:49:28,138 INFO L93 Difference]: Finished difference Result 541 states and 715 transitions. [2022-10-16 12:49:28,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:49:28,142 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-16 12:49:28,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:49:28,152 INFO L225 Difference]: With dead ends: 541 [2022-10-16 12:49:28,153 INFO L226 Difference]: Without dead ends: 537 [2022-10-16 12:49:28,155 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-16 12:49:28,157 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-16 12:49:28,158 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-16 12:49:28,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-10-16 12:49:28,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 531. [2022-10-16 12:49:28,279 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-16 12:49:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 711 transitions. [2022-10-16 12:49:28,288 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 711 transitions. Word has length 26 [2022-10-16 12:49:28,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:49:28,291 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 711 transitions. [2022-10-16 12:49:28,291 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-16 12:49:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 711 transitions. [2022-10-16 12:49:28,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-10-16 12:49:28,302 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:49:28,302 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-16 12:49:28,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 12:49:28,303 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-16 12:49:28,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:49:28,304 INFO L85 PathProgramCache]: Analyzing trace with hash -482153609, now seen corresponding path program 1 times [2022-10-16 12:49:28,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:49:28,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931882454] [2022-10-16 12:49:28,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:28,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:49:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:28,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:49:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:28,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-16 12:49:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:28,521 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-16 12:49:28,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:49:28,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931882454] [2022-10-16 12:49:28,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931882454] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:49:28,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:49:28,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:49:28,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759311676] [2022-10-16 12:49:28,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:49:28,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:49:28,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:49:28,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:49:28,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:49:28,531 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-16 12:49:29,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:49:29,083 INFO L93 Difference]: Finished difference Result 1179 states and 1583 transitions. [2022-10-16 12:49:29,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 12:49:29,084 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-16 12:49:29,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:49:29,091 INFO L225 Difference]: With dead ends: 1179 [2022-10-16 12:49:29,092 INFO L226 Difference]: Without dead ends: 651 [2022-10-16 12:49:29,094 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-16 12:49:29,095 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-16 12:49:29,096 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-16 12:49:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-10-16 12:49:29,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 626. [2022-10-16 12:49:29,140 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-16 12:49:29,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 834 transitions. [2022-10-16 12:49:29,145 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 834 transitions. Word has length 36 [2022-10-16 12:49:29,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:49:29,146 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 834 transitions. [2022-10-16 12:49:29,146 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-16 12:49:29,146 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 834 transitions. [2022-10-16 12:49:29,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-16 12:49:29,149 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:49:29,149 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-16 12:49:29,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 12:49:29,150 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-16 12:49:29,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:49:29,151 INFO L85 PathProgramCache]: Analyzing trace with hash 888153265, now seen corresponding path program 1 times [2022-10-16 12:49:29,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:49:29,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848747889] [2022-10-16 12:49:29,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:29,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:49:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:29,466 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-16 12:49:29,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:49:29,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848747889] [2022-10-16 12:49:29,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848747889] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:49:29,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:49:29,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:49:29,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101958716] [2022-10-16 12:49:29,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:49:29,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:49:29,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:49:29,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:49:29,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:49:29,469 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-16 12:49:29,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:49:29,955 INFO L93 Difference]: Finished difference Result 1300 states and 1729 transitions. [2022-10-16 12:49:29,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 12:49:29,956 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-16 12:49:29,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:49:29,963 INFO L225 Difference]: With dead ends: 1300 [2022-10-16 12:49:29,963 INFO L226 Difference]: Without dead ends: 920 [2022-10-16 12:49:29,965 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-16 12:49:29,966 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-16 12:49:29,967 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-16 12:49:29,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2022-10-16 12:49:30,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 630. [2022-10-16 12:49:30,021 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-16 12:49:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 838 transitions. [2022-10-16 12:49:30,025 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 838 transitions. Word has length 39 [2022-10-16 12:49:30,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:49:30,028 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 838 transitions. [2022-10-16 12:49:30,028 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-16 12:49:30,029 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 838 transitions. [2022-10-16 12:49:30,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-10-16 12:49:30,033 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:49:30,033 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-16 12:49:30,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 12:49:30,034 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-16 12:49:30,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:49:30,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1659416553, now seen corresponding path program 1 times [2022-10-16 12:49:30,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:49:30,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172574962] [2022-10-16 12:49:30,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:30,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:49:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:30,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 12:49:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:30,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-16 12:49:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:30,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 12:49:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:30,374 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-16 12:49:30,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:49:30,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172574962] [2022-10-16 12:49:30,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172574962] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:49:30,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:49:30,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:49:30,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218580686] [2022-10-16 12:49:30,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:49:30,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:49:30,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:49:30,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:49:30,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:49:30,383 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-16 12:49:30,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:49:30,853 INFO L93 Difference]: Finished difference Result 1212 states and 1624 transitions. [2022-10-16 12:49:30,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:49:30,854 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-16 12:49:30,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:49:30,861 INFO L225 Difference]: With dead ends: 1212 [2022-10-16 12:49:30,862 INFO L226 Difference]: Without dead ends: 685 [2022-10-16 12:49:30,864 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-16 12:49:30,868 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-16 12:49:30,871 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-16 12:49:30,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-10-16 12:49:30,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 660. [2022-10-16 12:49:30,947 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-16 12:49:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 874 transitions. [2022-10-16 12:49:30,954 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 874 transitions. Word has length 51 [2022-10-16 12:49:30,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:49:30,960 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 874 transitions. [2022-10-16 12:49:30,960 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-16 12:49:30,960 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 874 transitions. [2022-10-16 12:49:30,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 12:49:30,963 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:49:30,963 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-16 12:49:30,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 12:49:30,964 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-16 12:49:30,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:49:30,965 INFO L85 PathProgramCache]: Analyzing trace with hash -757179182, now seen corresponding path program 1 times [2022-10-16 12:49:30,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:49:30,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857259007] [2022-10-16 12:49:30,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:30,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:49:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:31,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 12:49:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:31,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-16 12:49:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:31,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 12:49:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:31,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-10-16 12:49:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:31,488 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-16 12:49:31,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:49:31,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857259007] [2022-10-16 12:49:31,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857259007] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:49:31,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:49:31,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 12:49:31,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824851129] [2022-10-16 12:49:31,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:49:31,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 12:49:31,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:49:31,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 12:49:31,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 12:49:31,491 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-16 12:49:32,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:49:32,477 INFO L93 Difference]: Finished difference Result 1364 states and 1860 transitions. [2022-10-16 12:49:32,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 12:49:32,477 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-16 12:49:32,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:49:32,486 INFO L225 Difference]: With dead ends: 1364 [2022-10-16 12:49:32,486 INFO L226 Difference]: Without dead ends: 807 [2022-10-16 12:49:32,489 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-16 12:49:32,498 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 157 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-10-16 12:49:32,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1595 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-10-16 12:49:32,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2022-10-16 12:49:32,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 630. [2022-10-16 12:49:32,565 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-16 12:49:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 836 transitions. [2022-10-16 12:49:32,570 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 836 transitions. Word has length 61 [2022-10-16 12:49:32,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:49:32,572 INFO L495 AbstractCegarLoop]: Abstraction has 630 states and 836 transitions. [2022-10-16 12:49:32,572 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-16 12:49:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 836 transitions. [2022-10-16 12:49:32,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-10-16 12:49:32,576 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:49:32,576 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-16 12:49:32,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 12:49:32,577 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-16 12:49:32,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:49:32,578 INFO L85 PathProgramCache]: Analyzing trace with hash 550582253, now seen corresponding path program 1 times [2022-10-16 12:49:32,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:49:32,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202558558] [2022-10-16 12:49:32,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:32,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:49:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:32,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 12:49:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:32,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-16 12:49:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:32,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 12:49:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:32,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-16 12:49:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:32,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 12:49:32,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:32,900 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-16 12:49:32,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:49:32,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202558558] [2022-10-16 12:49:32,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202558558] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:49:32,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:49:32,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:49:32,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016320027] [2022-10-16 12:49:32,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:49:32,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:49:32,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:49:32,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:49:32,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:49:32,903 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-16 12:49:33,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:49:33,449 INFO L93 Difference]: Finished difference Result 655 states and 873 transitions. [2022-10-16 12:49:33,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:49:33,450 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-16 12:49:33,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:49:33,455 INFO L225 Difference]: With dead ends: 655 [2022-10-16 12:49:33,455 INFO L226 Difference]: Without dead ends: 654 [2022-10-16 12:49:33,455 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-16 12:49:33,456 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 28 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-16 12:49:33,457 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-16 12:49:33,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-10-16 12:49:33,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 629. [2022-10-16 12:49:33,506 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-16 12:49:33,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 834 transitions. [2022-10-16 12:49:33,511 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 834 transitions. Word has length 71 [2022-10-16 12:49:33,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:49:33,512 INFO L495 AbstractCegarLoop]: Abstraction has 629 states and 834 transitions. [2022-10-16 12:49:33,512 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-16 12:49:33,513 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 834 transitions. [2022-10-16 12:49:33,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-10-16 12:49:33,515 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:49:33,515 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-16 12:49:33,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 12:49:33,516 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-16 12:49:33,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:49:33,517 INFO L85 PathProgramCache]: Analyzing trace with hash -111819200, now seen corresponding path program 1 times [2022-10-16 12:49:33,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:49:33,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752090086] [2022-10-16 12:49:33,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:33,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:49:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:33,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 12:49:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:33,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-16 12:49:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:33,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 12:49:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:33,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-16 12:49:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:33,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 12:49:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:33,869 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-16 12:49:33,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:49:33,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752090086] [2022-10-16 12:49:33,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752090086] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:49:33,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673650555] [2022-10-16 12:49:33,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:33,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:49:33,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:49:33,876 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 12:49:33,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-16 12:49:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:34,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 1323 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 12:49:34,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:49:34,353 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-16 12:49:34,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 12:49:34,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673650555] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:49:34,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 12:49:34,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-10-16 12:49:34,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917128091] [2022-10-16 12:49:34,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:49:34,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:49:34,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:49:34,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:49:34,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:49:34,358 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-16 12:49:35,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:49:35,020 INFO L93 Difference]: Finished difference Result 1294 states and 1755 transitions. [2022-10-16 12:49:35,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:49:35,021 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-16 12:49:35,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:49:35,027 INFO L225 Difference]: With dead ends: 1294 [2022-10-16 12:49:35,027 INFO L226 Difference]: Without dead ends: 768 [2022-10-16 12:49:35,029 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-16 12:49:35,030 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 237 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-10-16 12:49:35,030 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.6s Time] [2022-10-16 12:49:35,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2022-10-16 12:49:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 610. [2022-10-16 12:49:35,077 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-16 12:49:35,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 808 transitions. [2022-10-16 12:49:35,081 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 808 transitions. Word has length 72 [2022-10-16 12:49:35,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:49:35,083 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 808 transitions. [2022-10-16 12:49:35,083 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-16 12:49:35,084 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 808 transitions. [2022-10-16 12:49:35,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-10-16 12:49:35,087 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:49:35,088 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-16 12:49:35,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 12:49:35,301 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-16 12:49:35,302 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-16 12:49:35,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:49:35,303 INFO L85 PathProgramCache]: Analyzing trace with hash 578302560, now seen corresponding path program 1 times [2022-10-16 12:49:35,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:49:35,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116927108] [2022-10-16 12:49:35,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:35,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:49:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:35,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 12:49:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:35,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-16 12:49:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:35,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 12:49:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:35,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 12:49:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:35,559 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-16 12:49:35,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:49:35,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116927108] [2022-10-16 12:49:35,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116927108] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:49:35,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732805710] [2022-10-16 12:49:35,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:35,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:49:35,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:49:35,562 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 12:49:35,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-16 12:49:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:35,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 1339 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 12:49:35,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:49:35,934 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-16 12:49:35,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 12:49:35,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732805710] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:49:35,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 12:49:35,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-10-16 12:49:35,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523815515] [2022-10-16 12:49:35,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:49:35,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:49:35,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:49:35,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:49:35,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:49:35,937 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-16 12:49:35,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:49:35,995 INFO L93 Difference]: Finished difference Result 984 states and 1306 transitions. [2022-10-16 12:49:35,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:49:35,996 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-16 12:49:35,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:49:36,000 INFO L225 Difference]: With dead ends: 984 [2022-10-16 12:49:36,000 INFO L226 Difference]: Without dead ends: 616 [2022-10-16 12:49:36,002 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-16 12:49:36,003 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-16 12:49:36,003 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-16 12:49:36,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-10-16 12:49:36,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 615. [2022-10-16 12:49:36,047 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-16 12:49:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 814 transitions. [2022-10-16 12:49:36,052 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 814 transitions. Word has length 78 [2022-10-16 12:49:36,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:49:36,052 INFO L495 AbstractCegarLoop]: Abstraction has 615 states and 814 transitions. [2022-10-16 12:49:36,052 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-16 12:49:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 814 transitions. [2022-10-16 12:49:36,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-10-16 12:49:36,055 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:49:36,055 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-16 12:49:36,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 12:49:36,270 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-16 12:49:36,271 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-16 12:49:36,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:49:36,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1125025893, now seen corresponding path program 1 times [2022-10-16 12:49:36,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:49:36,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977025268] [2022-10-16 12:49:36,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:36,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:49:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:36,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 12:49:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:36,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-16 12:49:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:36,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 12:49:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:36,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 12:49:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:36,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 12:49:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:36,574 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-16 12:49:36,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:49:36,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977025268] [2022-10-16 12:49:36,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977025268] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:49:36,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198513090] [2022-10-16 12:49:36,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:36,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:49:36,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:49:36,577 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 12:49:36,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-16 12:49:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:36,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 12:49:36,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:49:36,951 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-16 12:49:36,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 12:49:36,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198513090] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:49:36,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 12:49:36,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-10-16 12:49:36,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66073828] [2022-10-16 12:49:36,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:49:36,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 12:49:36,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:49:36,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 12:49:36,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:49:36,954 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-16 12:49:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:49:37,026 INFO L93 Difference]: Finished difference Result 854 states and 1186 transitions. [2022-10-16 12:49:37,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 12:49:37,027 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-16 12:49:37,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:49:37,033 INFO L225 Difference]: With dead ends: 854 [2022-10-16 12:49:37,034 INFO L226 Difference]: Without dead ends: 853 [2022-10-16 12:49:37,035 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-16 12:49:37,036 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-16 12:49:37,036 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-16 12:49:37,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2022-10-16 12:49:37,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 614. [2022-10-16 12:49:37,089 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-16 12:49:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 813 transitions. [2022-10-16 12:49:37,094 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 813 transitions. Word has length 83 [2022-10-16 12:49:37,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:49:37,094 INFO L495 AbstractCegarLoop]: Abstraction has 614 states and 813 transitions. [2022-10-16 12:49:37,095 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-16 12:49:37,095 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 813 transitions. [2022-10-16 12:49:37,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-10-16 12:49:37,097 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:49:37,098 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-16 12:49:37,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-16 12:49:37,311 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-16 12:49:37,311 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-16 12:49:37,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:49:37,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1917470559, now seen corresponding path program 1 times [2022-10-16 12:49:37,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:49:37,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727348877] [2022-10-16 12:49:37,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:37,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:49:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:37,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 12:49:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:37,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-16 12:49:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:37,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 12:49:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:37,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 12:49:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:37,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 12:49:37,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:37,619 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-16 12:49:37,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:49:37,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727348877] [2022-10-16 12:49:37,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727348877] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:49:37,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95725513] [2022-10-16 12:49:37,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:37,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:49:37,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:49:37,622 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 12:49:37,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-16 12:49:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:37,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 1361 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 12:49:37,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:49:38,009 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-16 12:49:38,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 12:49:38,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-16 12:49:38,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95725513] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 12:49:38,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 12:49:38,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-10-16 12:49:38,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117568702] [2022-10-16 12:49:38,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 12:49:38,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 12:49:38,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:49:38,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 12:49:38,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-16 12:49:38,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-16 12:49:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:49:38,875 INFO L93 Difference]: Finished difference Result 1194 states and 1584 transitions. [2022-10-16 12:49:38,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 12:49:38,876 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-16 12:49:38,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:49:38,881 INFO L225 Difference]: With dead ends: 1194 [2022-10-16 12:49:38,882 INFO L226 Difference]: Without dead ends: 683 [2022-10-16 12:49:38,884 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-16 12:49:38,885 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.7s IncrementalHoareTripleChecker+Time [2022-10-16 12:49:38,885 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.7s Time] [2022-10-16 12:49:38,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-10-16 12:49:38,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 658. [2022-10-16 12:49:38,941 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-16 12:49:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 865 transitions. [2022-10-16 12:49:38,946 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 865 transitions. Word has length 87 [2022-10-16 12:49:38,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:49:38,946 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 865 transitions. [2022-10-16 12:49:38,946 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-16 12:49:38,947 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 865 transitions. [2022-10-16 12:49:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-10-16 12:49:38,949 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:49:38,950 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-16 12:49:38,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 12:49:39,163 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-16 12:49:39,164 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-16 12:49:39,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:49:39,164 INFO L85 PathProgramCache]: Analyzing trace with hash 775940619, now seen corresponding path program 1 times [2022-10-16 12:49:39,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:49:39,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385467568] [2022-10-16 12:49:39,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:39,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:49:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:39,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 12:49:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:39,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-16 12:49:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:39,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 12:49:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:39,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-16 12:49:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:39,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 12:49:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:39,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 12:49:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:39,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 12:49:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:39,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-16 12:49:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:39,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-16 12:49:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:39,524 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-16 12:49:39,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:49:39,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385467568] [2022-10-16 12:49:39,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385467568] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:49:39,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899605519] [2022-10-16 12:49:39,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:39,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:49:39,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:49:39,526 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 12:49:39,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-16 12:49:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:39,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 1623 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 12:49:39,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:49:40,193 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-16 12:49:40,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 12:49:40,364 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-16 12:49:40,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899605519] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 12:49:40,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 12:49:40,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2022-10-16 12:49:40,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880633293] [2022-10-16 12:49:40,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 12:49:40,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-16 12:49:40,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:49:40,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-16 12:49:40,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-10-16 12:49:40,370 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-16 12:49:41,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:49:41,433 INFO L93 Difference]: Finished difference Result 2073 states and 2756 transitions. [2022-10-16 12:49:41,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-16 12:49:41,433 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-16 12:49:41,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:49:41,474 INFO L225 Difference]: With dead ends: 2073 [2022-10-16 12:49:41,474 INFO L226 Difference]: Without dead ends: 1679 [2022-10-16 12:49:41,476 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-16 12:49:41,477 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-16 12:49:41,477 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-16 12:49:41,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2022-10-16 12:49:41,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1218. [2022-10-16 12:49:41,601 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-16 12:49:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1603 transitions. [2022-10-16 12:49:41,609 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1603 transitions. Word has length 127 [2022-10-16 12:49:41,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:49:41,609 INFO L495 AbstractCegarLoop]: Abstraction has 1218 states and 1603 transitions. [2022-10-16 12:49:41,610 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-16 12:49:41,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1603 transitions. [2022-10-16 12:49:41,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-10-16 12:49:41,613 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:49:41,613 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-16 12:49:41,655 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-16 12:49:41,827 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-16 12:49:41,828 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-16 12:49:41,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:49:41,829 INFO L85 PathProgramCache]: Analyzing trace with hash 110166857, now seen corresponding path program 1 times [2022-10-16 12:49:41,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:49:41,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144980076] [2022-10-16 12:49:41,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:41,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:49:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:42,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 12:49:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:42,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-16 12:49:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:42,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 12:49:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:42,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-16 12:49:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:42,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 12:49:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:42,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 12:49:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:42,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 12:49:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:42,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-16 12:49:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:42,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-16 12:49:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:42,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-10-16 12:49:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:42,257 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-16 12:49:42,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:49:42,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144980076] [2022-10-16 12:49:42,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144980076] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:49:42,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390424340] [2022-10-16 12:49:42,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:42,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:49:42,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:49:42,260 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 12:49:42,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-16 12:49:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:42,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 1646 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 12:49:42,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:49:42,915 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-16 12:49:42,915 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 12:49:42,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390424340] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:49:42,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 12:49:42,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-10-16 12:49:42,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234303499] [2022-10-16 12:49:42,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:49:42,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:49:42,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:49:42,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:49:42,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:49:42,918 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-16 12:49:43,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:49:43,150 INFO L93 Difference]: Finished difference Result 1379 states and 1814 transitions. [2022-10-16 12:49:43,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:49:43,151 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-16 12:49:43,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:49:43,159 INFO L225 Difference]: With dead ends: 1379 [2022-10-16 12:49:43,160 INFO L226 Difference]: Without dead ends: 1377 [2022-10-16 12:49:43,161 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-16 12:49:43,162 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-16 12:49:43,162 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-16 12:49:43,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2022-10-16 12:49:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1055. [2022-10-16 12:49:43,287 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-16 12:49:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1390 transitions. [2022-10-16 12:49:43,298 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1390 transitions. Word has length 137 [2022-10-16 12:49:43,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:49:43,299 INFO L495 AbstractCegarLoop]: Abstraction has 1055 states and 1390 transitions. [2022-10-16 12:49:43,299 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-16 12:49:43,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1390 transitions. [2022-10-16 12:49:43,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-10-16 12:49:43,304 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:49:43,304 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-16 12:49:43,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-16 12:49:43,519 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-16 12:49:43,519 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-16 12:49:43,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:49:43,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1466913640, now seen corresponding path program 1 times [2022-10-16 12:49:43,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:49:43,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232248086] [2022-10-16 12:49:43,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:43,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:49:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:43,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 12:49:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:43,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-16 12:49:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:43,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 12:49:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:43,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-16 12:49:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:43,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 12:49:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:43,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 12:49:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:43,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 12:49:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:43,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-16 12:49:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:43,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-16 12:49:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:43,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-10-16 12:49:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:43,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-10-16 12:49:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:43,893 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-16 12:49:43,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:49:43,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232248086] [2022-10-16 12:49:43,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232248086] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:49:43,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:49:43,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:49:43,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644128777] [2022-10-16 12:49:43,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:49:43,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:49:43,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:49:43,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:49:43,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:49:43,897 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-16 12:49:44,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:49:44,333 INFO L93 Difference]: Finished difference Result 1095 states and 1452 transitions. [2022-10-16 12:49:44,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:49:44,334 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-16 12:49:44,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:49:44,345 INFO L225 Difference]: With dead ends: 1095 [2022-10-16 12:49:44,345 INFO L226 Difference]: Without dead ends: 1094 [2022-10-16 12:49:44,346 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-16 12:49:44,347 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 26 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-10-16 12:49:44,347 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.3s Time] [2022-10-16 12:49:44,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2022-10-16 12:49:44,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1046. [2022-10-16 12:49:44,470 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-16 12:49:44,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1378 transitions. [2022-10-16 12:49:44,477 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1378 transitions. Word has length 140 [2022-10-16 12:49:44,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:49:44,477 INFO L495 AbstractCegarLoop]: Abstraction has 1046 states and 1378 transitions. [2022-10-16 12:49:44,479 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-16 12:49:44,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1378 transitions. [2022-10-16 12:49:44,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-10-16 12:49:44,487 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:49:44,487 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-16 12:49:44,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 12:49:44,487 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-16 12:49:44,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:49:44,488 INFO L85 PathProgramCache]: Analyzing trace with hash 427362110, now seen corresponding path program 1 times [2022-10-16 12:49:44,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:49:44,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814052759] [2022-10-16 12:49:44,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:44,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:49:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:44,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 12:49:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:44,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-16 12:49:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:44,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 12:49:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:44,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-16 12:49:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:44,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 12:49:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:44,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 12:49:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:44,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 12:49:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:44,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-10-16 12:49:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:44,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-10-16 12:49:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:44,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-10-16 12:49:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:44,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-10-16 12:49:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:44,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-10-16 12:49:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:44,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-10-16 12:49:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:45,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-10-16 12:49:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:45,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-10-16 12:49:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:45,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-10-16 12:49:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:45,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-10-16 12:49:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:45,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-10-16 12:49:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:45,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-10-16 12:49:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:45,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-10-16 12:49:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:45,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-10-16 12:49:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:45,053 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-16 12:49:45,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:49:45,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814052759] [2022-10-16 12:49:45,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814052759] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:49:45,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:49:45,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:49:45,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986131482] [2022-10-16 12:49:45,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:49:45,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:49:45,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:49:45,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:49:45,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:49:45,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-16 12:49:45,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:49:45,718 INFO L93 Difference]: Finished difference Result 1819 states and 2401 transitions. [2022-10-16 12:49:45,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 12:49:45,719 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-16 12:49:45,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:49:45,727 INFO L225 Difference]: With dead ends: 1819 [2022-10-16 12:49:45,728 INFO L226 Difference]: Without dead ends: 876 [2022-10-16 12:49:45,735 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-16 12:49:45,736 INFO L413 NwaCegarLoop]: 339 mSDtfsCounter, 169 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-10-16 12:49:45,736 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.5s Time] [2022-10-16 12:49:45,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2022-10-16 12:49:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 846. [2022-10-16 12:49:45,837 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-16 12:49:45,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1104 transitions. [2022-10-16 12:49:45,842 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1104 transitions. Word has length 271 [2022-10-16 12:49:45,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:49:45,842 INFO L495 AbstractCegarLoop]: Abstraction has 846 states and 1104 transitions. [2022-10-16 12:49:45,843 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-16 12:49:45,843 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1104 transitions. [2022-10-16 12:49:45,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-10-16 12:49:45,850 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:49:45,851 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-16 12:49:45,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-16 12:49:45,851 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-16 12:49:45,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:49:45,852 INFO L85 PathProgramCache]: Analyzing trace with hash -2126177888, now seen corresponding path program 2 times [2022-10-16 12:49:45,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:49:45,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683386081] [2022-10-16 12:49:45,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:49:45,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:49:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-16 12:49:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-16 12:49:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-10-16 12:49:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-10-16 12:49:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 12:49:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 12:49:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 12:49:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-10-16 12:49:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-10-16 12:49:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-10-16 12:49:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-10-16 12:49:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-10-16 12:49:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-10-16 12:49:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-10-16 12:49:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-10-16 12:49:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-10-16 12:49:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-10-16 12:49:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-10-16 12:49:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-10-16 12:49:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2022-10-16 12:49:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-10-16 12:49:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:49:46,457 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-16 12:49:46,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:49:46,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683386081] [2022-10-16 12:49:46,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683386081] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:49:46,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:49:46,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:49:46,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63783364] [2022-10-16 12:49:46,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:49:46,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:49:46,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:49:46,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:49:46,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:49:46,512 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-16 12:49:46,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:49:46,841 INFO L93 Difference]: Finished difference Result 1145 states and 1497 transitions. [2022-10-16 12:49:46,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 12:49:46,842 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-16 12:49:46,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:49:46,843 INFO L225 Difference]: With dead ends: 1145 [2022-10-16 12:49:46,843 INFO L226 Difference]: Without dead ends: 0 [2022-10-16 12:49:46,845 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-16 12:49:46,846 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-16 12:49:46,846 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-16 12:49:46,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-16 12:49:46,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-16 12:49:46,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 12:49:46,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-16 12:49:46,848 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 293 [2022-10-16 12:49:46,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:49:46,848 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-16 12:49:46,849 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-16 12:49:46,849 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-16 12:49:46,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-16 12:49:46,853 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2022-10-16 12:49:46,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2022-10-16 12:49:46,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2022-10-16 12:49:46,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2022-10-16 12:49:46,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2022-10-16 12:49:46,854 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2022-10-16 12:49:46,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2022-10-16 12:49:46,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2022-10-16 12:49:46,855 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2022-10-16 12:49:46,856 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2022-10-16 12:49:46,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-16 12:49:46,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-16 12:49:50,449 INFO L899 garLoopResultBuilder]: For program point L2945(lines 2945 2948) no Hoare annotation was computed. [2022-10-16 12:49:50,450 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_lock_mtx_of_isl_pmicEXIT(lines 2942 2952) no Hoare annotation was computed. [2022-10-16 12:49:50,450 INFO L899 garLoopResultBuilder]: For program point L2947-1(lines 2945 2948) no Hoare annotation was computed. [2022-10-16 12:49:50,450 INFO L902 garLoopResultBuilder]: At program point ldv_mutex_lock_mtx_of_isl_pmicENTRY(lines 2942 2952) the Hoare annotation is: true [2022-10-16 12:49:50,451 INFO L902 garLoopResultBuilder]: At program point L2947(line 2947) the Hoare annotation is: true [2022-10-16 12:49:50,451 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_lock_mtx_of_isl_pmicFINAL(lines 2942 2952) no Hoare annotation was computed. [2022-10-16 12:49:50,451 INFO L902 garLoopResultBuilder]: At program point ldv_mutex_unlock_mtx_of_isl_pmicENTRY(lines 3000 3010) the Hoare annotation is: true [2022-10-16 12:49:50,451 INFO L899 garLoopResultBuilder]: For program point L3005-1(lines 3003 3006) no Hoare annotation was computed. [2022-10-16 12:49:50,451 INFO L902 garLoopResultBuilder]: At program point L3005(line 3005) the Hoare annotation is: true [2022-10-16 12:49:50,451 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_unlock_mtx_of_isl_pmicEXIT(lines 3000 3010) no Hoare annotation was computed. [2022-10-16 12:49:50,451 INFO L899 garLoopResultBuilder]: For program point L3003(lines 3003 3006) no Hoare annotation was computed. [2022-10-16 12:49:50,452 INFO L899 garLoopResultBuilder]: For program point ldv_mutex_unlock_mtx_of_isl_pmicFINAL(lines 3000 3010) no Hoare annotation was computed. [2022-10-16 12:49:50,452 INFO L899 garLoopResultBuilder]: For program point regulator_list_voltage_linearFINAL(lines 3204 3206) no Hoare annotation was computed. [2022-10-16 12:49:50,452 INFO L899 garLoopResultBuilder]: For program point regulator_list_voltage_linearEXIT(lines 3204 3206) no Hoare annotation was computed. [2022-10-16 12:49:50,453 INFO L902 garLoopResultBuilder]: At program point regulator_list_voltage_linearENTRY(lines 3204 3206) the Hoare annotation is: true [2022-10-16 12:49:50,453 INFO L902 garLoopResultBuilder]: At program point mutex_unlockENTRY(lines 3197 3199) the Hoare annotation is: true [2022-10-16 12:49:50,453 INFO L899 garLoopResultBuilder]: For program point mutex_unlockEXIT(lines 3197 3199) no Hoare annotation was computed. [2022-10-16 12:49:50,453 INFO L899 garLoopResultBuilder]: For program point mutex_unlockFINAL(lines 3197 3199) no Hoare annotation was computed. [2022-10-16 12:49:50,457 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-16 12:49:50,457 INFO L902 garLoopResultBuilder]: At program point L3162(line 3162) the Hoare annotation is: true [2022-10-16 12:49:50,457 INFO L899 garLoopResultBuilder]: For program point L3160(line 3160) no Hoare annotation was computed. [2022-10-16 12:49:50,457 INFO L899 garLoopResultBuilder]: For program point L3162-1(line 3162) no Hoare annotation was computed. [2022-10-16 12:49:50,457 INFO L899 garLoopResultBuilder]: For program point L3156(line 3156) no Hoare annotation was computed. [2022-10-16 12:49:50,457 INFO L899 garLoopResultBuilder]: For program point L3155(lines 3155 3157) no Hoare annotation was computed. [2022-10-16 12:49:50,457 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 3158 3164) no Hoare annotation was computed. [2022-10-16 12:49:50,458 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 3158 3164) no Hoare annotation was computed. [2022-10-16 12:49:50,458 INFO L899 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 2684 2689) no Hoare annotation was computed. [2022-10-16 12:49:50,458 INFO L902 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 2684 2689) the Hoare annotation is: true [2022-10-16 12:49:50,458 INFO L899 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 2684 2689) no Hoare annotation was computed. [2022-10-16 12:49:50,458 INFO L902 garLoopResultBuilder]: At program point regulator_unregisterENTRY(lines 3214 3216) the Hoare annotation is: true [2022-10-16 12:49:50,458 INFO L899 garLoopResultBuilder]: For program point regulator_unregisterFINAL(lines 3214 3216) no Hoare annotation was computed. [2022-10-16 12:49:50,458 INFO L899 garLoopResultBuilder]: For program point regulator_unregisterEXIT(lines 3214 3216) no Hoare annotation was computed. [2022-10-16 12:49:50,458 INFO L902 garLoopResultBuilder]: At program point mutex_lockENTRY(lines 3190 3192) the Hoare annotation is: true [2022-10-16 12:49:50,458 INFO L899 garLoopResultBuilder]: For program point mutex_lockFINAL(lines 3190 3192) no Hoare annotation was computed. [2022-10-16 12:49:50,459 INFO L899 garLoopResultBuilder]: For program point mutex_lockEXIT(lines 3190 3192) no Hoare annotation was computed. [2022-10-16 12:49:50,459 INFO L899 garLoopResultBuilder]: For program point L2529(lines 2529 2533) no Hoare annotation was computed. [2022-10-16 12:49:50,459 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2368) no Hoare annotation was computed. [2022-10-16 12:49:50,459 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-16 12:49:50,459 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-16 12:49:50,460 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-16 12:49:50,460 INFO L899 garLoopResultBuilder]: For program point L2480(line 2480) no Hoare annotation was computed. [2022-10-16 12:49:50,460 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-16 12:49:50,460 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-16 12:49:50,460 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-16 12:49:50,461 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-16 12:49:50,461 INFO L899 garLoopResultBuilder]: For program point L2563(line 2563) no Hoare annotation was computed. [2022-10-16 12:49:50,461 INFO L899 garLoopResultBuilder]: For program point L2464(lines 2464 2468) no Hoare annotation was computed. [2022-10-16 12:49:50,461 INFO L899 garLoopResultBuilder]: For program point L2530-1(line 2530) no Hoare annotation was computed. [2022-10-16 12:49:50,461 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-16 12:49:50,461 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-16 12:49:50,462 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-16 12:49:50,462 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-16 12:49:50,462 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2476) no Hoare annotation was computed. [2022-10-16 12:49:50,462 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-16 12:49:50,462 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-16 12:49:50,463 INFO L899 garLoopResultBuilder]: For program point L2564(lines 2564 2579) no Hoare annotation was computed. [2022-10-16 12:49:50,463 INFO L895 garLoopResultBuilder]: At program point L2366(line 2366) the Hoare annotation is: false [2022-10-16 12:49:50,463 INFO L899 garLoopResultBuilder]: For program point L2366-1(line 2366) no Hoare annotation was computed. [2022-10-16 12:49:50,463 INFO L899 garLoopResultBuilder]: For program point L3126(lines 3126 3129) no Hoare annotation was computed. [2022-10-16 12:49:50,463 INFO L899 garLoopResultBuilder]: For program point L2581(line 2581) no Hoare annotation was computed. [2022-10-16 12:49:50,463 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2476) no Hoare annotation was computed. [2022-10-16 12:49:50,463 INFO L902 garLoopResultBuilder]: At program point L3176(lines 3175 3177) the Hoare annotation is: true [2022-10-16 12:49:50,464 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-16 12:49:50,464 INFO L899 garLoopResultBuilder]: For program point L2466(line 2466) no Hoare annotation was computed. [2022-10-16 12:49:50,464 INFO L899 garLoopResultBuilder]: For program point L2499(line 2499) no Hoare annotation was computed. [2022-10-16 12:49:50,464 INFO L899 garLoopResultBuilder]: For program point L2466-1(line 2466) no Hoare annotation was computed. [2022-10-16 12:49:50,464 INFO L895 garLoopResultBuilder]: At program point L2367(lines 2310 2376) the Hoare annotation is: false [2022-10-16 12:49:50,464 INFO L895 garLoopResultBuilder]: At program point L2169(lines 2166 2171) the Hoare annotation is: false [2022-10-16 12:49:50,464 INFO L899 garLoopResultBuilder]: For program point L2549(line 2549) no Hoare annotation was computed. [2022-10-16 12:49:50,464 INFO L899 garLoopResultBuilder]: For program point L2566(lines 2566 2576) no Hoare annotation was computed. [2022-10-16 12:49:50,464 INFO L899 garLoopResultBuilder]: For program point L2500(lines 2500 2515) no Hoare annotation was computed. [2022-10-16 12:49:50,465 INFO L899 garLoopResultBuilder]: For program point L2368(line 2368) no Hoare annotation was computed. [2022-10-16 12:49:50,465 INFO L902 garLoopResultBuilder]: At program point L3128(line 3128) the Hoare annotation is: true [2022-10-16 12:49:50,465 INFO L899 garLoopResultBuilder]: For program point L2550(lines 2550 2554) no Hoare annotation was computed. [2022-10-16 12:49:50,465 INFO L899 garLoopResultBuilder]: For program point L3128-1(lines 3125 3143) no Hoare annotation was computed. [2022-10-16 12:49:50,465 INFO L899 garLoopResultBuilder]: For program point L2517(line 2517) no Hoare annotation was computed. [2022-10-16 12:49:50,465 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-16 12:49:50,465 INFO L899 garLoopResultBuilder]: For program point L2567(line 2567) no Hoare annotation was computed. [2022-10-16 12:49:50,465 INFO L899 garLoopResultBuilder]: For program point L2369(lines 2369 2373) no Hoare annotation was computed. [2022-10-16 12:49:50,466 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-16 12:49:50,466 INFO L899 garLoopResultBuilder]: For program point L2353-1(line 2353) no Hoare annotation was computed. [2022-10-16 12:49:50,466 INFO L899 garLoopResultBuilder]: For program point L2353(line 2353) no Hoare annotation was computed. [2022-10-16 12:49:50,466 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-16 12:49:50,466 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-16 12:49:50,467 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-16 12:49:50,467 INFO L899 garLoopResultBuilder]: For program point L3212-1(line 3212) no Hoare annotation was computed. [2022-10-16 12:49:50,467 INFO L899 garLoopResultBuilder]: For program point L2568(lines 2568 2572) no Hoare annotation was computed. [2022-10-16 12:49:50,467 INFO L899 garLoopResultBuilder]: For program point L2502(lines 2502 2508) no Hoare annotation was computed. [2022-10-16 12:49:50,467 INFO L899 garLoopResultBuilder]: For program point L2535(line 2535) no Hoare annotation was computed. [2022-10-16 12:49:50,467 INFO L899 garLoopResultBuilder]: For program point L2502-2(lines 2500 2514) no Hoare annotation was computed. [2022-10-16 12:49:50,467 INFO L895 garLoopResultBuilder]: At program point L2370(lines 2310 2376) the Hoare annotation is: false [2022-10-16 12:49:50,467 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-16 12:49:50,467 INFO L899 garLoopResultBuilder]: For program point L2337(lines 2337 2341) no Hoare annotation was computed. [2022-10-16 12:49:50,468 INFO L899 garLoopResultBuilder]: For program point L2337-2(lines 2337 2341) no Hoare annotation was computed. [2022-10-16 12:49:50,468 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-16 12:49:50,468 INFO L899 garLoopResultBuilder]: For program point L2321(lines 2321 2324) no Hoare annotation was computed. [2022-10-16 12:49:50,468 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-16 12:49:50,468 INFO L899 garLoopResultBuilder]: For program point L2536(lines 2536 2540) no Hoare annotation was computed. [2022-10-16 12:49:50,468 INFO L899 garLoopResultBuilder]: For program point L2569-1(line 2569) no Hoare annotation was computed. [2022-10-16 12:49:50,468 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-16 12:49:50,469 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2368) no Hoare annotation was computed. [2022-10-16 12:49:50,469 INFO L899 garLoopResultBuilder]: For program point L2487(line 2487) no Hoare annotation was computed. [2022-10-16 12:49:50,469 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-16 12:49:50,469 INFO L899 garLoopResultBuilder]: For program point L2388-1(line 2388) no Hoare annotation was computed. [2022-10-16 12:49:50,469 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2389) no Hoare annotation was computed. [2022-10-16 12:49:50,469 INFO L895 garLoopResultBuilder]: At program point L2372(lines 2310 2376) the Hoare annotation is: false [2022-10-16 12:49:50,470 INFO L902 garLoopResultBuilder]: At program point L3132(line 3132) the Hoare annotation is: true [2022-10-16 12:49:50,470 INFO L899 garLoopResultBuilder]: For program point L3132-1(lines 3125 3143) no Hoare annotation was computed. [2022-10-16 12:49:50,470 INFO L899 garLoopResultBuilder]: For program point L2488(lines 2488 2522) no Hoare annotation was computed. [2022-10-16 12:49:50,470 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-16 12:49:50,470 INFO L899 garLoopResultBuilder]: For program point L2389-1(line 2389) no Hoare annotation was computed. [2022-10-16 12:49:50,470 INFO L899 garLoopResultBuilder]: For program point L2389(line 2389) no Hoare annotation was computed. [2022-10-16 12:49:50,470 INFO L899 garLoopResultBuilder]: For program point L2257-1(line 2257) no Hoare annotation was computed. [2022-10-16 12:49:50,471 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-16 12:49:50,471 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-16 12:49:50,471 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-16 12:49:50,471 INFO L899 garLoopResultBuilder]: For program point L2472(line 2472) no Hoare annotation was computed. [2022-10-16 12:49:50,471 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2389) no Hoare annotation was computed. [2022-10-16 12:49:50,472 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-16 12:49:50,472 INFO L899 garLoopResultBuilder]: For program point L2274-1(line 2274) no Hoare annotation was computed. [2022-10-16 12:49:50,472 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2353) no Hoare annotation was computed. [2022-10-16 12:49:50,472 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-16 12:49:50,472 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-16 12:49:50,472 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-16 12:49:50,472 INFO L902 garLoopResultBuilder]: At program point L2588(lines 2441 2590) the Hoare annotation is: true [2022-10-16 12:49:50,473 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-16 12:49:50,473 INFO L899 garLoopResultBuilder]: For program point L3166-1(line 3166) no Hoare annotation was computed. [2022-10-16 12:49:50,473 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-16 12:49:50,473 INFO L899 garLoopResultBuilder]: For program point L2456(lines 2456 2583) no Hoare annotation was computed. [2022-10-16 12:49:50,473 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-16 12:49:50,473 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-16 12:49:50,474 INFO L899 garLoopResultBuilder]: For program point L2473(lines 2473 2478) no Hoare annotation was computed. [2022-10-16 12:49:50,474 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-16 12:49:50,474 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2353) no Hoare annotation was computed. [2022-10-16 12:49:50,474 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-16 12:49:50,474 INFO L899 garLoopResultBuilder]: For program point L2556(line 2556) no Hoare annotation was computed. [2022-10-16 12:49:50,474 INFO L899 garLoopResultBuilder]: For program point L2490(lines 2490 2519) no Hoare annotation was computed. [2022-10-16 12:49:50,475 INFO L899 garLoopResultBuilder]: For program point L2457(line 2457) no Hoare annotation was computed. [2022-10-16 12:49:50,475 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-16 12:49:50,475 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-16 12:49:50,475 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-16 12:49:50,475 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-16 12:49:50,475 INFO L899 garLoopResultBuilder]: For program point L2524(line 2524) no Hoare annotation was computed. [2022-10-16 12:49:50,475 INFO L899 garLoopResultBuilder]: For program point L2458(lines 2458 2485) no Hoare annotation was computed. [2022-10-16 12:49:50,476 INFO L899 garLoopResultBuilder]: For program point L2491(line 2491) no Hoare annotation was computed. [2022-10-16 12:49:50,476 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-16 12:49:50,476 INFO L902 garLoopResultBuilder]: At program point L2425(lines 2421 2427) the Hoare annotation is: true [2022-10-16 12:49:50,476 INFO L899 garLoopResultBuilder]: For program point L2574(line 2574) no Hoare annotation was computed. [2022-10-16 12:49:50,476 INFO L902 garLoopResultBuilder]: At program point L3136(line 3136) the Hoare annotation is: true [2022-10-16 12:49:50,476 INFO L899 garLoopResultBuilder]: For program point L3136-1(lines 3125 3143) no Hoare annotation was computed. [2022-10-16 12:49:50,476 INFO L899 garLoopResultBuilder]: For program point L2492(lines 2492 2497) no Hoare annotation was computed. [2022-10-16 12:49:50,476 INFO L899 garLoopResultBuilder]: For program point L2525(lines 2525 2561) no Hoare annotation was computed. [2022-10-16 12:49:50,477 INFO L899 garLoopResultBuilder]: For program point L2327(lines 2327 2330) no Hoare annotation was computed. [2022-10-16 12:49:50,477 INFO L899 garLoopResultBuilder]: For program point L2261(lines 2261 2264) no Hoare annotation was computed. [2022-10-16 12:49:50,477 INFO L899 garLoopResultBuilder]: For program point L2261-2(lines 2261 2264) no Hoare annotation was computed. [2022-10-16 12:49:50,477 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-16 12:49:50,477 INFO L899 garLoopResultBuilder]: For program point L2542(line 2542) no Hoare annotation was computed. [2022-10-16 12:49:50,477 INFO L899 garLoopResultBuilder]: For program point L2476(line 2476) no Hoare annotation was computed. [2022-10-16 12:49:50,477 INFO L899 garLoopResultBuilder]: For program point L2476-1(line 2476) no Hoare annotation was computed. [2022-10-16 12:49:50,477 INFO L899 garLoopResultBuilder]: For program point L2278(lines 2278 2281) no Hoare annotation was computed. [2022-10-16 12:49:50,477 INFO L899 garLoopResultBuilder]: For program point L2278-2(lines 2278 2281) no Hoare annotation was computed. [2022-10-16 12:49:50,478 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-16 12:49:50,478 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-16 12:49:50,478 INFO L899 garLoopResultBuilder]: For program point L-1-1(line -1) no Hoare annotation was computed. [2022-10-16 12:49:50,478 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2466) no Hoare annotation was computed. [2022-10-16 12:49:50,478 INFO L899 garLoopResultBuilder]: For program point L2460(lines 2460 2482) no Hoare annotation was computed. [2022-10-16 12:49:50,478 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-16 12:49:50,478 INFO L899 garLoopResultBuilder]: For program point L2543(lines 2543 2547) no Hoare annotation was computed. [2022-10-16 12:49:50,478 INFO L899 garLoopResultBuilder]: For program point L2345-1(line 2345) no Hoare annotation was computed. [2022-10-16 12:49:50,479 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-16 12:49:50,479 INFO L899 garLoopResultBuilder]: For program point L2527(lines 2527 2558) no Hoare annotation was computed. [2022-10-16 12:49:50,479 INFO L899 garLoopResultBuilder]: For program point L2461(line 2461) no Hoare annotation was computed. [2022-10-16 12:49:50,479 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 2466) no Hoare annotation was computed. [2022-10-16 12:49:50,479 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-16 12:49:50,479 INFO L902 garLoopResultBuilder]: At program point L2511(lines 2447 2589) the Hoare annotation is: true [2022-10-16 12:49:50,479 INFO L899 garLoopResultBuilder]: For program point L2346(lines 2346 2352) no Hoare annotation was computed. [2022-10-16 12:49:50,479 INFO L899 garLoopResultBuilder]: For program point L2528(line 2528) no Hoare annotation was computed. [2022-10-16 12:49:50,480 INFO L899 garLoopResultBuilder]: For program point L2462(lines 2462 2470) no Hoare annotation was computed. [2022-10-16 12:49:50,480 INFO L899 garLoopResultBuilder]: For program point L3173-1(line 3173) no Hoare annotation was computed. [2022-10-16 12:49:50,480 INFO L902 garLoopResultBuilder]: At program point L3140(line 3140) the Hoare annotation is: true [2022-10-16 12:49:50,480 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-16 12:49:50,480 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-16 12:49:50,480 INFO L902 garLoopResultBuilder]: At program point L3140-1(lines 3123 3144) the Hoare annotation is: true [2022-10-16 12:49:50,480 INFO L899 garLoopResultBuilder]: For program point L3201-1(line 3201) no Hoare annotation was computed. [2022-10-16 12:49:50,480 INFO L899 garLoopResultBuilder]: For program point rdev_get_drvdataEXIT(lines 3200 3202) no Hoare annotation was computed. [2022-10-16 12:49:50,481 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-16 12:49:50,481 INFO L899 garLoopResultBuilder]: For program point rdev_get_drvdataFINAL(lines 3200 3202) no Hoare annotation was computed. [2022-10-16 12:49:50,481 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-16 12:49:50,481 INFO L902 garLoopResultBuilder]: At program point IS_ERRENTRY(lines 2172 2178) the Hoare annotation is: true [2022-10-16 12:49:50,481 INFO L899 garLoopResultBuilder]: For program point IS_ERRFINAL(lines 2172 2178) no Hoare annotation was computed. [2022-10-16 12:49:50,482 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-16 12:49:50,482 INFO L899 garLoopResultBuilder]: For program point IS_ERREXIT(lines 2172 2178) no Hoare annotation was computed. [2022-10-16 12:49:50,486 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:49:50,489 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 12:49:50,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:49:50 BoogieIcfgContainer [2022-10-16 12:49:50,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 12:49:50,521 INFO L158 Benchmark]: Toolchain (without parser) took 27018.70ms. Allocated memory was 157.3MB in the beginning and 390.1MB in the end (delta: 232.8MB). Free memory was 126.7MB in the beginning and 174.4MB in the end (delta: -47.8MB). Peak memory consumption was 237.5MB. Max. memory is 8.0GB. [2022-10-16 12:49:50,521 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 157.3MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 12:49:50,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1180.66ms. Allocated memory is still 157.3MB. Free memory was 126.5MB in the beginning and 105.5MB in the end (delta: 21.0MB). Peak memory consumption was 32.7MB. Max. memory is 8.0GB. [2022-10-16 12:49:50,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 165.74ms. Allocated memory is still 157.3MB. Free memory was 105.5MB in the beginning and 99.7MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-10-16 12:49:50,523 INFO L158 Benchmark]: Boogie Preprocessor took 76.97ms. Allocated memory is still 157.3MB. Free memory was 99.2MB in the beginning and 94.5MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-10-16 12:49:50,523 INFO L158 Benchmark]: RCFGBuilder took 1455.21ms. Allocated memory was 157.3MB in the beginning and 197.1MB in the end (delta: 39.8MB). Free memory was 94.5MB in the beginning and 148.9MB in the end (delta: -54.4MB). Peak memory consumption was 58.3MB. Max. memory is 8.0GB. [2022-10-16 12:49:50,524 INFO L158 Benchmark]: TraceAbstraction took 24128.08ms. Allocated memory was 197.1MB in the beginning and 390.1MB in the end (delta: 192.9MB). Free memory was 147.8MB in the beginning and 174.4MB in the end (delta: -26.6MB). Peak memory consumption was 217.7MB. Max. memory is 8.0GB. [2022-10-16 12:49:50,526 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.28ms. Allocated memory is still 157.3MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1180.66ms. Allocated memory is still 157.3MB. Free memory was 126.5MB in the beginning and 105.5MB in the end (delta: 21.0MB). Peak memory consumption was 32.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 165.74ms. Allocated memory is still 157.3MB. Free memory was 105.5MB in the beginning and 99.7MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 76.97ms. Allocated memory is still 157.3MB. Free memory was 99.2MB in the beginning and 94.5MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1455.21ms. Allocated memory was 157.3MB in the beginning and 197.1MB in the end (delta: 39.8MB). Free memory was 94.5MB in the beginning and 148.9MB in the end (delta: -54.4MB). Peak memory consumption was 58.3MB. Max. memory is 8.0GB. * TraceAbstraction took 24128.08ms. Allocated memory was 197.1MB in the beginning and 390.1MB in the end (delta: 192.9MB). Free memory was 147.8MB in the beginning and 174.4MB in the end (delta: -26.6MB). Peak memory consumption was 217.7MB. 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.0s, OverallIterations: 16, TraceHistogramMax: 12, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.6s, 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.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 1832 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 76 LocationsWithAnnotation, 1335 PreInvPairs, 1459 NumberOfFragments, 1670 HoareAnnotationTreeSize, 1335 FomulaSimplifications, 4993 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 76 FomulaSimplificationsInter, 7445 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 5.6s 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-16 12:49:50,596 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...