/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-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 12:30:01,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 12:30:01,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 12:30:01,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 12:30:01,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 12:30:01,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 12:30:01,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 12:30:01,737 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 12:30:01,740 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 12:30:01,741 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 12:30:01,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 12:30:01,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 12:30:01,745 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 12:30:01,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 12:30:01,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 12:30:01,749 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 12:30:01,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 12:30:01,752 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 12:30:01,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 12:30:01,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 12:30:01,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 12:30:01,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 12:30:01,762 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 12:30:01,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 12:30:01,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 12:30:01,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 12:30:01,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 12:30:01,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 12:30:01,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 12:30:01,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 12:30:01,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 12:30:01,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 12:30:01,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 12:30:01,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 12:30:01,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 12:30:01,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 12:30:01,779 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 12:30:01,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 12:30:01,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 12:30:01,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 12:30:01,782 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 12:30:01,783 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:30:01,814 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 12:30:01,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 12:30:01,815 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 12:30:01,815 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 12:30:01,816 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 12:30:01,816 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 12:30:01,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 12:30:01,818 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 12:30:01,818 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 12:30:01,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 12:30:01,818 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 12:30:01,819 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 12:30:01,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 12:30:01,819 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 12:30:01,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 12:30:01,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 12:30:01,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 12:30:01,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 12:30:01,820 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 12:30:01,821 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 12:30:01,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 12:30:01,821 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 12:30:01,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 12:30:01,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 12:30:01,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 12:30:01,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 12:30:01,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:30:01,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 12:30:01,823 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 12:30:01,824 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 12:30:01,824 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 12:30:01,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 12:30:01,824 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 12:30:01,824 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:30:02,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 12:30:02,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 12:30:02,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 12:30:02,341 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 12:30:02,342 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 12:30:02,344 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2022-10-16 12:30:02,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f287f3d6c/655d90c5b8784889850849345c7ee090/FLAGf66289d20 [2022-10-16 12:30:03,631 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 12:30:03,631 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2022-10-16 12:30:03,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f287f3d6c/655d90c5b8784889850849345c7ee090/FLAGf66289d20 [2022-10-16 12:30:04,088 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f287f3d6c/655d90c5b8784889850849345c7ee090 [2022-10-16 12:30:04,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 12:30:04,101 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 12:30:04,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 12:30:04,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 12:30:04,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 12:30:04,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:30:04" (1/1) ... [2022-10-16 12:30:04,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ebd3939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:04, skipping insertion in model container [2022-10-16 12:30:04,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:30:04" (1/1) ... [2022-10-16 12:30:04,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 12:30:04,258 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 12:30:05,842 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-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i[202834,202847] [2022-10-16 12:30:05,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:30:05,887 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 12:30:06,230 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-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i[202834,202847] [2022-10-16 12:30:06,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 12:30:06,403 INFO L208 MainTranslator]: Completed translation [2022-10-16 12:30:06,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:06 WrapperNode [2022-10-16 12:30:06,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 12:30:06,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 12:30:06,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 12:30:06,411 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 12:30:06,421 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:30:06" (1/1) ... [2022-10-16 12:30:06,582 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:30:06" (1/1) ... [2022-10-16 12:30:06,738 INFO L138 Inliner]: procedures = 157, calls = 810, calls flagged for inlining = 80, calls inlined = 79, statements flattened = 2862 [2022-10-16 12:30:06,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 12:30:06,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 12:30:06,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 12:30:06,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 12:30:06,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:06" (1/1) ... [2022-10-16 12:30:06,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:06" (1/1) ... [2022-10-16 12:30:06,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:06" (1/1) ... [2022-10-16 12:30:06,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:06" (1/1) ... [2022-10-16 12:30:06,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:06" (1/1) ... [2022-10-16 12:30:06,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:06" (1/1) ... [2022-10-16 12:30:06,927 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:06" (1/1) ... [2022-10-16 12:30:06,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:06" (1/1) ... [2022-10-16 12:30:06,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 12:30:06,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 12:30:06,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 12:30:06,976 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 12:30:06,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:06" (1/1) ... [2022-10-16 12:30:06,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 12:30:07,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:30:07,021 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:30:07,045 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:30:07,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-10-16 12:30:07,091 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-10-16 12:30:07,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-10-16 12:30:07,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-10-16 12:30:07,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 12:30:07,091 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-10-16 12:30:07,092 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-10-16 12:30:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-10-16 12:30:07,092 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-10-16 12:30:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-10-16 12:30:07,092 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-10-16 12:30:07,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-10-16 12:30:07,093 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-10-16 12:30:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-10-16 12:30:07,093 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-10-16 12:30:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-16 12:30:07,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-16 12:30:07,093 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-10-16 12:30:07,093 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-10-16 12:30:07,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive_int [2022-10-16 12:30:07,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive_int [2022-10-16 12:30:07,094 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-10-16 12:30:07,094 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-10-16 12:30:07,094 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-10-16 12:30:07,094 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-10-16 12:30:07,094 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-10-16 12:30:07,095 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-10-16 12:30:07,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 12:30:07,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-10-16 12:30:07,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-10-16 12:30:07,095 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2022-10-16 12:30:07,095 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2022-10-16 12:30:07,095 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-10-16 12:30:07,096 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-10-16 12:30:07,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-10-16 12:30:07,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-10-16 12:30:07,097 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-10-16 12:30:07,097 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-10-16 12:30:07,097 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-10-16 12:30:07,097 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-10-16 12:30:07,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 12:30:07,097 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-10-16 12:30:07,097 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-10-16 12:30:07,098 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-10-16 12:30:07,098 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-10-16 12:30:07,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 12:30:07,098 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-10-16 12:30:07,098 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-10-16 12:30:07,098 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-10-16 12:30:07,098 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-10-16 12:30:07,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 12:30:07,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 12:30:07,099 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-10-16 12:30:07,099 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-10-16 12:30:07,099 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-10-16 12:30:07,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 12:30:07,100 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-10-16 12:30:07,100 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-10-16 12:30:07,100 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-10-16 12:30:07,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-10-16 12:30:07,100 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-10-16 12:30:07,100 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-10-16 12:30:07,100 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-10-16 12:30:07,101 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-10-16 12:30:07,101 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-10-16 12:30:07,101 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-10-16 12:30:07,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 12:30:07,101 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-10-16 12:30:07,101 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-10-16 12:30:07,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-16 12:30:07,102 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2022-10-16 12:30:07,102 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2022-10-16 12:30:07,102 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-10-16 12:30:07,102 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-10-16 12:30:07,102 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-10-16 12:30:07,102 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-10-16 12:30:07,103 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-10-16 12:30:07,103 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-10-16 12:30:07,103 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-10-16 12:30:07,103 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-10-16 12:30:07,103 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-10-16 12:30:07,103 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-10-16 12:30:07,103 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-10-16 12:30:07,104 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-10-16 12:30:07,104 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-10-16 12:30:07,104 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-10-16 12:30:07,104 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-10-16 12:30:07,104 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-10-16 12:30:07,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 12:30:07,104 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-10-16 12:30:07,105 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-10-16 12:30:07,105 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2022-10-16 12:30:07,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2022-10-16 12:30:07,105 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-10-16 12:30:07,105 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-10-16 12:30:07,105 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-10-16 12:30:07,105 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-10-16 12:30:07,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-10-16 12:30:07,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 12:30:07,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 12:30:07,106 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-10-16 12:30:07,106 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-10-16 12:30:07,106 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-10-16 12:30:07,107 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-10-16 12:30:07,872 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 12:30:07,876 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 12:30:10,852 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 12:30:10,870 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 12:30:10,870 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-16 12:30:10,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:30:10 BoogieIcfgContainer [2022-10-16 12:30:10,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 12:30:10,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 12:30:10,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 12:30:10,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 12:30:10,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:30:04" (1/3) ... [2022-10-16 12:30:10,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf6bec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:30:10, skipping insertion in model container [2022-10-16 12:30:10,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:30:06" (2/3) ... [2022-10-16 12:30:10,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf6bec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:30:10, skipping insertion in model container [2022-10-16 12:30:10,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:30:10" (3/3) ... [2022-10-16 12:30:10,887 INFO L112 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2022-10-16 12:30:10,908 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 12:30:10,908 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-10-16 12:30:10,995 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 12:30:11,005 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;@313c0fa4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 12:30:11,005 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-10-16 12:30:11,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 1124 states, 793 states have (on average 1.4918032786885247) internal successors, (1183), 899 states have internal predecessors, (1183), 207 states have call successors, (207), 43 states have call predecessors, (207), 43 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) [2022-10-16 12:30:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-16 12:30:11,036 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:11,037 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] [2022-10-16 12:30:11,038 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:11,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:11,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1008385009, now seen corresponding path program 1 times [2022-10-16 12:30:11,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:11,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737131532] [2022-10-16 12:30:11,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:11,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:11,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:11,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:11,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:11,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:11,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:11,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-16 12:30:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:11,753 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:30:11,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:11,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737131532] [2022-10-16 12:30:11,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737131532] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:11,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:11,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:30:11,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308352239] [2022-10-16 12:30:11,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:11,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:30:11,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:11,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:30:11,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:30:11,829 INFO L87 Difference]: Start difference. First operand has 1124 states, 793 states have (on average 1.4918032786885247) internal successors, (1183), 899 states have internal predecessors, (1183), 207 states have call successors, (207), 43 states have call predecessors, (207), 43 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-16 12:30:13,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:13,261 INFO L93 Difference]: Finished difference Result 2240 states and 3237 transitions. [2022-10-16 12:30:13,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:30:13,264 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), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 48 [2022-10-16 12:30:13,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:13,293 INFO L225 Difference]: With dead ends: 2240 [2022-10-16 12:30:13,293 INFO L226 Difference]: Without dead ends: 1107 [2022-10-16 12:30:13,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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:30:13,312 INFO L413 NwaCegarLoop]: 1513 mSDtfsCounter, 1722 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1858 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:13,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1858 Valid, 2244 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-10-16 12:30:13,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2022-10-16 12:30:13,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1089. [2022-10-16 12:30:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 782 states have (on average 1.4565217391304348) internal successors, (1139), 865 states have internal predecessors, (1139), 206 states have call successors, (206), 43 states have call predecessors, (206), 43 states have return successors, (206), 204 states have call predecessors, (206), 206 states have call successors, (206) [2022-10-16 12:30:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1551 transitions. [2022-10-16 12:30:13,480 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1551 transitions. Word has length 48 [2022-10-16 12:30:13,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:13,481 INFO L495 AbstractCegarLoop]: Abstraction has 1089 states and 1551 transitions. [2022-10-16 12:30:13,481 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), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-16 12:30:13,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1551 transitions. [2022-10-16 12:30:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-16 12:30:13,485 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:13,485 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] [2022-10-16 12:30:13,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 12:30:13,486 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:13,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:13,487 INFO L85 PathProgramCache]: Analyzing trace with hash -985752755, now seen corresponding path program 1 times [2022-10-16 12:30:13,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:13,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561983428] [2022-10-16 12:30:13,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:13,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:13,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:13,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:13,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:13,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:13,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:13,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-10-16 12:30:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:13,789 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:30:13,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:13,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561983428] [2022-10-16 12:30:13,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561983428] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:13,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:13,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 12:30:13,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901207043] [2022-10-16 12:30:13,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:13,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 12:30:13,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:13,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 12:30:13,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:30:13,796 INFO L87 Difference]: Start difference. First operand 1089 states and 1551 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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:30:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:16,073 INFO L93 Difference]: Finished difference Result 2179 states and 3110 transitions. [2022-10-16 12:30:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 12:30:16,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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 48 [2022-10-16 12:30:16,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:16,084 INFO L225 Difference]: With dead ends: 2179 [2022-10-16 12:30:16,085 INFO L226 Difference]: Without dead ends: 1107 [2022-10-16 12:30:16,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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:30:16,091 INFO L413 NwaCegarLoop]: 1510 mSDtfsCounter, 386 mSDsluCounter, 2698 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 4208 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:16,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 4208 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-10-16 12:30:16,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2022-10-16 12:30:16,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1089. [2022-10-16 12:30:16,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 782 states have (on average 1.4552429667519182) internal successors, (1138), 865 states have internal predecessors, (1138), 206 states have call successors, (206), 43 states have call predecessors, (206), 43 states have return successors, (206), 204 states have call predecessors, (206), 206 states have call successors, (206) [2022-10-16 12:30:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1550 transitions. [2022-10-16 12:30:16,173 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1550 transitions. Word has length 48 [2022-10-16 12:30:16,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:16,176 INFO L495 AbstractCegarLoop]: Abstraction has 1089 states and 1550 transitions. [2022-10-16 12:30:16,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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:30:16,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1550 transitions. [2022-10-16 12:30:16,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-10-16 12:30:16,187 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:16,187 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:30:16,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 12:30:16,188 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:16,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:16,195 INFO L85 PathProgramCache]: Analyzing trace with hash 461179900, now seen corresponding path program 1 times [2022-10-16 12:30:16,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:16,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541804354] [2022-10-16 12:30:16,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:16,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:16,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:16,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:16,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:16,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:16,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:16,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 12:30:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:16,583 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:30:16,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:16,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541804354] [2022-10-16 12:30:16,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541804354] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:16,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:16,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 12:30:16,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003094083] [2022-10-16 12:30:16,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:16,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 12:30:16,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:16,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 12:30:16,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:30:16,588 INFO L87 Difference]: Start difference. First operand 1089 states and 1550 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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:30:18,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:18,660 INFO L93 Difference]: Finished difference Result 1189 states and 1687 transitions. [2022-10-16 12:30:18,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 12:30:18,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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 51 [2022-10-16 12:30:18,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:18,673 INFO L225 Difference]: With dead ends: 1189 [2022-10-16 12:30:18,673 INFO L226 Difference]: Without dead ends: 1133 [2022-10-16 12:30:18,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:30:18,676 INFO L413 NwaCegarLoop]: 1480 mSDtfsCounter, 1714 mSDsluCounter, 1478 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 2958 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:18,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1856 Valid, 2958 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-10-16 12:30:18,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2022-10-16 12:30:18,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1113. [2022-10-16 12:30:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 800 states have (on average 1.4525) internal successors, (1162), 885 states have internal predecessors, (1162), 212 states have call successors, (212), 43 states have call predecessors, (212), 43 states have return successors, (212), 210 states have call predecessors, (212), 212 states have call successors, (212) [2022-10-16 12:30:18,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1586 transitions. [2022-10-16 12:30:18,755 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1586 transitions. Word has length 51 [2022-10-16 12:30:18,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:18,756 INFO L495 AbstractCegarLoop]: Abstraction has 1113 states and 1586 transitions. [2022-10-16 12:30:18,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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:30:18,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1586 transitions. [2022-10-16 12:30:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-10-16 12:30:18,759 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:18,760 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] [2022-10-16 12:30:18,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 12:30:18,760 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:18,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:18,761 INFO L85 PathProgramCache]: Analyzing trace with hash -165325051, now seen corresponding path program 1 times [2022-10-16 12:30:18,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:18,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537662832] [2022-10-16 12:30:18,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:18,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:18,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:18,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:18,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:18,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:18,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:18,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 12:30:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:18,981 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:30:18,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:18,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537662832] [2022-10-16 12:30:18,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537662832] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:18,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:18,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 12:30:18,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36345794] [2022-10-16 12:30:18,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:18,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 12:30:18,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:18,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 12:30:18,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:30:18,988 INFO L87 Difference]: Start difference. First operand 1113 states and 1586 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 12:30:21,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 12:30:23,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:23,304 INFO L93 Difference]: Finished difference Result 1254 states and 1782 transitions. [2022-10-16 12:30:23,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 12:30:23,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 56 [2022-10-16 12:30:23,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:23,318 INFO L225 Difference]: With dead ends: 1254 [2022-10-16 12:30:23,319 INFO L226 Difference]: Without dead ends: 1174 [2022-10-16 12:30:23,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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:30:23,334 INFO L413 NwaCegarLoop]: 1509 mSDtfsCounter, 409 mSDsluCounter, 2676 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 219 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 4185 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:23,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 4185 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 1448 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-10-16 12:30:23,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2022-10-16 12:30:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1132. [2022-10-16 12:30:23,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 815 states have (on average 1.4478527607361964) internal successors, (1180), 901 states have internal predecessors, (1180), 216 states have call successors, (216), 43 states have call predecessors, (216), 43 states have return successors, (216), 214 states have call predecessors, (216), 216 states have call successors, (216) [2022-10-16 12:30:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1612 transitions. [2022-10-16 12:30:23,419 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1612 transitions. Word has length 56 [2022-10-16 12:30:23,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:23,421 INFO L495 AbstractCegarLoop]: Abstraction has 1132 states and 1612 transitions. [2022-10-16 12:30:23,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 12:30:23,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1612 transitions. [2022-10-16 12:30:23,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-10-16 12:30:23,425 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:23,426 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-16 12:30:23,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 12:30:23,426 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:23,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:23,427 INFO L85 PathProgramCache]: Analyzing trace with hash -830202508, now seen corresponding path program 1 times [2022-10-16 12:30:23,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:23,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741873115] [2022-10-16 12:30:23,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:23,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:23,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:23,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:23,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:23,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:23,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:23,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 12:30:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:23,671 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:23,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:23,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741873115] [2022-10-16 12:30:23,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741873115] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:30:23,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048181654] [2022-10-16 12:30:23,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:23,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:30:23,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:30:23,686 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:30:23,709 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:30:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:24,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 12:30:24,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:30:24,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:24,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 12:30:24,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:24,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048181654] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 12:30:24,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 12:30:24,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-10-16 12:30:24,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993214926] [2022-10-16 12:30:24,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 12:30:24,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 12:30:24,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:24,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 12:30:24,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-16 12:30:24,191 INFO L87 Difference]: Start difference. First operand 1132 states and 1612 transitions. Second operand has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 12:30:27,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:27,180 INFO L93 Difference]: Finished difference Result 1299 states and 1865 transitions. [2022-10-16 12:30:27,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 12:30:27,181 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2022-10-16 12:30:27,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:27,194 INFO L225 Difference]: With dead ends: 1299 [2022-10-16 12:30:27,195 INFO L226 Difference]: Without dead ends: 1297 [2022-10-16 12:30:27,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-16 12:30:27,206 INFO L413 NwaCegarLoop]: 1553 mSDtfsCounter, 529 mSDsluCounter, 3718 mSDsCounter, 0 mSdLazyCounter, 2116 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 5271 SdHoareTripleChecker+Invalid, 2375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 2116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:27,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 5271 Invalid, 2375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 2116 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-10-16 12:30:27,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2022-10-16 12:30:27,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1240. [2022-10-16 12:30:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 896 states have (on average 1.4475446428571428) internal successors, (1297), 991 states have internal predecessors, (1297), 243 states have call successors, (243), 43 states have call predecessors, (243), 43 states have return successors, (243), 241 states have call predecessors, (243), 243 states have call successors, (243) [2022-10-16 12:30:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1783 transitions. [2022-10-16 12:30:27,291 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1783 transitions. Word has length 57 [2022-10-16 12:30:27,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:27,291 INFO L495 AbstractCegarLoop]: Abstraction has 1240 states and 1783 transitions. [2022-10-16 12:30:27,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 12:30:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1783 transitions. [2022-10-16 12:30:27,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-10-16 12:30:27,293 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:27,294 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] [2022-10-16 12:30:27,337 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:30:27,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:30:27,509 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:27,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:27,511 INFO L85 PathProgramCache]: Analyzing trace with hash -205418670, now seen corresponding path program 1 times [2022-10-16 12:30:27,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:27,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928723923] [2022-10-16 12:30:27,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:27,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:27,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:27,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:27,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:27,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:27,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:27,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-10-16 12:30:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:27,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 12:30:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:27,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-10-16 12:30:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:27,704 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:30:27,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:27,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928723923] [2022-10-16 12:30:27,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928723923] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:27,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:27,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:30:27,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420037943] [2022-10-16 12:30:27,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:27,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:30:27,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:27,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:30:27,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:30:27,707 INFO L87 Difference]: Start difference. First operand 1240 states and 1783 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 12:30:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:29,933 INFO L93 Difference]: Finished difference Result 3233 states and 4724 transitions. [2022-10-16 12:30:29,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:30:29,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2022-10-16 12:30:29,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:29,949 INFO L225 Difference]: With dead ends: 3233 [2022-10-16 12:30:29,950 INFO L226 Difference]: Without dead ends: 2012 [2022-10-16 12:30:29,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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:30:29,956 INFO L413 NwaCegarLoop]: 1619 mSDtfsCounter, 1033 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 3277 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:29,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 3277 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-10-16 12:30:29,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2012 states. [2022-10-16 12:30:30,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2012 to 1759. [2022-10-16 12:30:30,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1297 states have (on average 1.466461063993832) internal successors, (1902), 1407 states have internal predecessors, (1902), 363 states have call successors, (363), 43 states have call predecessors, (363), 43 states have return successors, (363), 360 states have call predecessors, (363), 363 states have call successors, (363) [2022-10-16 12:30:30,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2628 transitions. [2022-10-16 12:30:30,079 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2628 transitions. Word has length 60 [2022-10-16 12:30:30,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:30,080 INFO L495 AbstractCegarLoop]: Abstraction has 1759 states and 2628 transitions. [2022-10-16 12:30:30,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 12:30:30,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2628 transitions. [2022-10-16 12:30:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-10-16 12:30:30,082 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:30,082 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:30:30,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 12:30:30,083 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:30,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:30,083 INFO L85 PathProgramCache]: Analyzing trace with hash 33528070, now seen corresponding path program 1 times [2022-10-16 12:30:30,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:30,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162312698] [2022-10-16 12:30:30,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:30,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:30,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:30,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:30,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:30,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:30,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:30,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-10-16 12:30:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:30,345 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:30,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:30,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162312698] [2022-10-16 12:30:30,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162312698] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 12:30:30,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106340481] [2022-10-16 12:30:30,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:30,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 12:30:30,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 12:30:30,348 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:30:30,362 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:30:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:30,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 12:30:30,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 12:30:30,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 12:30:30,679 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 12:30:30,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106340481] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:30,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 12:30:30,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-10-16 12:30:30,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141595337] [2022-10-16 12:30:30,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:30,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:30:30,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:30,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:30:30,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:30:30,683 INFO L87 Difference]: Start difference. First operand 1759 states and 2628 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 12:30:30,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:30,836 INFO L93 Difference]: Finished difference Result 1760 states and 2629 transitions. [2022-10-16 12:30:30,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:30:30,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-10-16 12:30:30,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:30,850 INFO L225 Difference]: With dead ends: 1760 [2022-10-16 12:30:30,850 INFO L226 Difference]: Without dead ends: 1758 [2022-10-16 12:30:30,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 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:30:30,853 INFO L413 NwaCegarLoop]: 1549 mSDtfsCounter, 47 mSDsluCounter, 3021 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 4570 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:30,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 4570 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 12:30:30,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2022-10-16 12:30:30,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1757. [2022-10-16 12:30:30,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1757 states, 1297 states have (on average 1.4595219737856593) internal successors, (1893), 1405 states have internal predecessors, (1893), 363 states have call successors, (363), 43 states have call predecessors, (363), 43 states have return successors, (363), 360 states have call predecessors, (363), 363 states have call successors, (363) [2022-10-16 12:30:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1757 states to 1757 states and 2619 transitions. [2022-10-16 12:30:31,017 INFO L78 Accepts]: Start accepts. Automaton has 1757 states and 2619 transitions. Word has length 58 [2022-10-16 12:30:31,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:31,018 INFO L495 AbstractCegarLoop]: Abstraction has 1757 states and 2619 transitions. [2022-10-16 12:30:31,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 12:30:31,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1757 states and 2619 transitions. [2022-10-16 12:30:31,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-10-16 12:30:31,020 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:31,020 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:30:31,062 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:30:31,220 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,SelfDestructingSolverStorable6 [2022-10-16 12:30:31,221 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:31,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:31,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1000363897, now seen corresponding path program 1 times [2022-10-16 12:30:31,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:31,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780392122] [2022-10-16 12:30:31,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:31,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:31,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:31,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:31,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:31,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:31,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:31,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-10-16 12:30:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:31,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 12:30:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:31,460 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:30:31,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:31,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780392122] [2022-10-16 12:30:31,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780392122] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:31,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:31,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:30:31,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905381463] [2022-10-16 12:30:31,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:31,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 12:30:31,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:31,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 12:30:31,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:30:31,463 INFO L87 Difference]: Start difference. First operand 1757 states and 2619 transitions. Second operand has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 12:30:35,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:35,652 INFO L93 Difference]: Finished difference Result 5365 states and 8233 transitions. [2022-10-16 12:30:35,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 12:30:35,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2022-10-16 12:30:35,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:35,703 INFO L225 Difference]: With dead ends: 5365 [2022-10-16 12:30:35,704 INFO L226 Difference]: Without dead ends: 5364 [2022-10-16 12:30:35,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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:30:35,708 INFO L413 NwaCegarLoop]: 3381 mSDtfsCounter, 2365 mSDsluCounter, 5482 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2695 SdHoareTripleChecker+Valid, 8863 SdHoareTripleChecker+Invalid, 2580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:35,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2695 Valid, 8863 Invalid, 2580 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [505 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-10-16 12:30:35,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5364 states. [2022-10-16 12:30:35,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5364 to 1756. [2022-10-16 12:30:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1297 states have (on average 1.4579799537393987) internal successors, (1891), 1404 states have internal predecessors, (1891), 363 states have call successors, (363), 43 states have call predecessors, (363), 43 states have return successors, (363), 360 states have call predecessors, (363), 363 states have call successors, (363) [2022-10-16 12:30:35,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2617 transitions. [2022-10-16 12:30:35,948 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2617 transitions. Word has length 61 [2022-10-16 12:30:35,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:35,948 INFO L495 AbstractCegarLoop]: Abstraction has 1756 states and 2617 transitions. [2022-10-16 12:30:35,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 12:30:35,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2617 transitions. [2022-10-16 12:30:35,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-10-16 12:30:35,950 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:35,950 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, 1] [2022-10-16 12:30:35,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 12:30:35,951 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:35,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:35,952 INFO L85 PathProgramCache]: Analyzing trace with hash -946508908, now seen corresponding path program 1 times [2022-10-16 12:30:35,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:35,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964976442] [2022-10-16 12:30:35,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:35,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:36,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:36,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:36,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:36,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:36,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:36,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-10-16 12:30:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:36,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 12:30:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:36,173 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:30:36,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:36,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964976442] [2022-10-16 12:30:36,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964976442] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:36,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:36,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:30:36,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126353388] [2022-10-16 12:30:36,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:36,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 12:30:36,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:36,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 12:30:36,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 12:30:36,176 INFO L87 Difference]: Start difference. First operand 1756 states and 2617 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 12:30:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:40,271 INFO L93 Difference]: Finished difference Result 5364 states and 8231 transitions. [2022-10-16 12:30:40,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 12:30:40,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-10-16 12:30:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:40,312 INFO L225 Difference]: With dead ends: 5364 [2022-10-16 12:30:40,312 INFO L226 Difference]: Without dead ends: 5363 [2022-10-16 12:30:40,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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:30:40,318 INFO L413 NwaCegarLoop]: 3382 mSDtfsCounter, 2362 mSDsluCounter, 5485 mSDsCounter, 0 mSdLazyCounter, 2073 mSolverCounterSat, 507 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2690 SdHoareTripleChecker+Valid, 8867 SdHoareTripleChecker+Invalid, 2580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 507 IncrementalHoareTripleChecker+Valid, 2073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:40,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2690 Valid, 8867 Invalid, 2580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [507 Valid, 2073 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-10-16 12:30:40,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5363 states. [2022-10-16 12:30:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5363 to 1755. [2022-10-16 12:30:40,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1297 states have (on average 1.4564379336931381) internal successors, (1889), 1403 states have internal predecessors, (1889), 363 states have call successors, (363), 43 states have call predecessors, (363), 43 states have return successors, (363), 360 states have call predecessors, (363), 363 states have call successors, (363) [2022-10-16 12:30:40,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2615 transitions. [2022-10-16 12:30:40,521 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2615 transitions. Word has length 62 [2022-10-16 12:30:40,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:40,523 INFO L495 AbstractCegarLoop]: Abstraction has 1755 states and 2615 transitions. [2022-10-16 12:30:40,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 12:30:40,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2615 transitions. [2022-10-16 12:30:40,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-10-16 12:30:40,532 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:40,532 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, 1, 1, 1] [2022-10-16 12:30:40,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 12:30:40,532 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:40,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:40,533 INFO L85 PathProgramCache]: Analyzing trace with hash 938032729, now seen corresponding path program 1 times [2022-10-16 12:30:40,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:40,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177442067] [2022-10-16 12:30:40,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:40,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:40,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:40,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:40,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:40,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:40,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:40,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-10-16 12:30:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:40,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 12:30:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:40,677 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:30:40,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:40,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177442067] [2022-10-16 12:30:40,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177442067] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:40,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:40,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:30:40,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85364358] [2022-10-16 12:30:40,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:40,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:30:40,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:40,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:30:40,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:30:40,680 INFO L87 Difference]: Start difference. First operand 1755 states and 2615 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 12:30:42,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:42,961 INFO L93 Difference]: Finished difference Result 3088 states and 4717 transitions. [2022-10-16 12:30:42,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:30:42,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2022-10-16 12:30:42,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:42,986 INFO L225 Difference]: With dead ends: 3088 [2022-10-16 12:30:42,986 INFO L226 Difference]: Without dead ends: 3085 [2022-10-16 12:30:42,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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:30:42,990 INFO L413 NwaCegarLoop]: 2451 mSDtfsCounter, 1063 mSDsluCounter, 2478 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 4929 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:42,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 4929 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-10-16 12:30:42,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2022-10-16 12:30:43,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 1773. [2022-10-16 12:30:43,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1311 states have (on average 1.4546147978642259) internal successors, (1907), 1417 states have internal predecessors, (1907), 367 states have call successors, (367), 43 states have call predecessors, (367), 43 states have return successors, (367), 364 states have call predecessors, (367), 367 states have call successors, (367) [2022-10-16 12:30:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2641 transitions. [2022-10-16 12:30:43,179 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2641 transitions. Word has length 64 [2022-10-16 12:30:43,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:43,179 INFO L495 AbstractCegarLoop]: Abstraction has 1773 states and 2641 transitions. [2022-10-16 12:30:43,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 12:30:43,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2641 transitions. [2022-10-16 12:30:43,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-10-16 12:30:43,186 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:43,187 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, 1, 1, 1] [2022-10-16 12:30:43,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 12:30:43,187 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:43,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:43,188 INFO L85 PathProgramCache]: Analyzing trace with hash 938032791, now seen corresponding path program 1 times [2022-10-16 12:30:43,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:43,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202366370] [2022-10-16 12:30:43,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:43,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:43,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:43,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:43,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:43,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:43,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:43,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-10-16 12:30:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:43,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 12:30:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:43,470 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:30:43,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:43,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202366370] [2022-10-16 12:30:43,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202366370] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:43,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:43,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 12:30:43,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323741792] [2022-10-16 12:30:43,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:43,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 12:30:43,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:43,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 12:30:43,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 12:30:43,474 INFO L87 Difference]: Start difference. First operand 1773 states and 2641 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 12:30:45,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 12:30:47,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-10-16 12:30:52,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:52,476 INFO L93 Difference]: Finished difference Result 5381 states and 8259 transitions. [2022-10-16 12:30:52,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 12:30:52,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2022-10-16 12:30:52,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:52,511 INFO L225 Difference]: With dead ends: 5381 [2022-10-16 12:30:52,511 INFO L226 Difference]: Without dead ends: 5378 [2022-10-16 12:30:52,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-10-16 12:30:52,515 INFO L413 NwaCegarLoop]: 3367 mSDtfsCounter, 3641 mSDsluCounter, 7251 mSDsCounter, 0 mSdLazyCounter, 2808 mSolverCounterSat, 945 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3828 SdHoareTripleChecker+Valid, 10618 SdHoareTripleChecker+Invalid, 3755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 945 IncrementalHoareTripleChecker+Valid, 2808 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:52,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3828 Valid, 10618 Invalid, 3755 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [945 Valid, 2808 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2022-10-16 12:30:52,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5378 states. [2022-10-16 12:30:52,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5378 to 1752. [2022-10-16 12:30:52,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1752 states, 1297 states have (on average 1.4518118735543561) internal successors, (1883), 1400 states have internal predecessors, (1883), 363 states have call successors, (363), 43 states have call predecessors, (363), 43 states have return successors, (363), 360 states have call predecessors, (363), 363 states have call successors, (363) [2022-10-16 12:30:52,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 2609 transitions. [2022-10-16 12:30:52,776 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 2609 transitions. Word has length 64 [2022-10-16 12:30:52,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:52,776 INFO L495 AbstractCegarLoop]: Abstraction has 1752 states and 2609 transitions. [2022-10-16 12:30:52,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 12:30:52,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 2609 transitions. [2022-10-16 12:30:52,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-16 12:30:52,780 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:52,780 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, 1, 1, 1, 1] [2022-10-16 12:30:52,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 12:30:52,780 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:52,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:52,781 INFO L85 PathProgramCache]: Analyzing trace with hash -985755636, now seen corresponding path program 1 times [2022-10-16 12:30:52,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:52,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391576529] [2022-10-16 12:30:52,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:52,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:52,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:52,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:52,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:52,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:52,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:52,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-10-16 12:30:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:52,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 12:30:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:52,927 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:30:52,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:52,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391576529] [2022-10-16 12:30:52,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391576529] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:52,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:52,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:30:52,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359304814] [2022-10-16 12:30:52,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:52,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:30:52,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:52,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:30:52,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:30:52,930 INFO L87 Difference]: Start difference. First operand 1752 states and 2609 transitions. Second operand has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 12:30:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:55,298 INFO L93 Difference]: Finished difference Result 2972 states and 4517 transitions. [2022-10-16 12:30:55,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:30:55,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 65 [2022-10-16 12:30:55,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:55,314 INFO L225 Difference]: With dead ends: 2972 [2022-10-16 12:30:55,315 INFO L226 Difference]: Without dead ends: 2969 [2022-10-16 12:30:55,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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:30:55,317 INFO L413 NwaCegarLoop]: 2366 mSDtfsCounter, 1061 mSDsluCounter, 2338 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 4704 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:55,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1263 Valid, 4704 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-10-16 12:30:55,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2022-10-16 12:30:55,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 1749. [2022-10-16 12:30:55,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1749 states, 1297 states have (on average 1.4471858134155744) internal successors, (1877), 1397 states have internal predecessors, (1877), 363 states have call successors, (363), 43 states have call predecessors, (363), 43 states have return successors, (363), 360 states have call predecessors, (363), 363 states have call successors, (363) [2022-10-16 12:30:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2603 transitions. [2022-10-16 12:30:55,536 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2603 transitions. Word has length 65 [2022-10-16 12:30:55,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:55,536 INFO L495 AbstractCegarLoop]: Abstraction has 1749 states and 2603 transitions. [2022-10-16 12:30:55,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 12:30:55,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2603 transitions. [2022-10-16 12:30:55,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-10-16 12:30:55,539 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:55,540 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:30:55,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 12:30:55,540 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:55,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:55,540 INFO L85 PathProgramCache]: Analyzing trace with hash 829761248, now seen corresponding path program 1 times [2022-10-16 12:30:55,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:55,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132059715] [2022-10-16 12:30:55,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:55,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:55,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:55,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:55,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:55,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:55,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:55,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 12:30:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:55,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 12:30:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:55,717 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:30:55,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:55,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132059715] [2022-10-16 12:30:55,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132059715] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:55,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:55,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:30:55,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237967202] [2022-10-16 12:30:55,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:55,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:30:55,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:55,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:30:55,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:30:55,720 INFO L87 Difference]: Start difference. First operand 1749 states and 2603 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 12:30:58,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:30:58,090 INFO L93 Difference]: Finished difference Result 4493 states and 6770 transitions. [2022-10-16 12:30:58,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:30:58,090 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2022-10-16 12:30:58,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:30:58,104 INFO L225 Difference]: With dead ends: 4493 [2022-10-16 12:30:58,104 INFO L226 Difference]: Without dead ends: 2763 [2022-10-16 12:30:58,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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:30:58,114 INFO L413 NwaCegarLoop]: 1598 mSDtfsCounter, 1040 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 3068 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-10-16 12:30:58,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 3068 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-10-16 12:30:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2763 states. [2022-10-16 12:30:58,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2763 to 2524. [2022-10-16 12:30:58,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2524 states, 1886 states have (on average 1.4575821845174974) internal successors, (2749), 2008 states have internal predecessors, (2749), 551 states have call successors, (551), 43 states have call predecessors, (551), 43 states have return successors, (551), 546 states have call predecessors, (551), 551 states have call successors, (551) [2022-10-16 12:30:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2524 states and 3851 transitions. [2022-10-16 12:30:58,414 INFO L78 Accepts]: Start accepts. Automaton has 2524 states and 3851 transitions. Word has length 69 [2022-10-16 12:30:58,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:30:58,415 INFO L495 AbstractCegarLoop]: Abstraction has 2524 states and 3851 transitions. [2022-10-16 12:30:58,415 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 12:30:58,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 3851 transitions. [2022-10-16 12:30:58,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-10-16 12:30:58,418 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:30:58,418 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:30:58,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 12:30:58,419 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:30:58,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:30:58,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1439332099, now seen corresponding path program 1 times [2022-10-16 12:30:58,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:30:58,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593525008] [2022-10-16 12:30:58,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:30:58,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:30:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:58,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:30:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:58,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:58,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:30:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:58,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:30:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:58,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:30:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:58,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 12:30:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:58,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 12:30:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:30:58,674 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:30:58,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:30:58,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593525008] [2022-10-16 12:30:58,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593525008] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:30:58,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:30:58,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 12:30:58,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564082983] [2022-10-16 12:30:58,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:30:58,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:30:58,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:30:58,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:30:58,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:30:58,680 INFO L87 Difference]: Start difference. First operand 2524 states and 3851 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 12:31:01,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:31:01,129 INFO L93 Difference]: Finished difference Result 4635 states and 7217 transitions. [2022-10-16 12:31:01,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:31:01,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2022-10-16 12:31:01,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:31:01,154 INFO L225 Difference]: With dead ends: 4635 [2022-10-16 12:31:01,159 INFO L226 Difference]: Without dead ends: 4633 [2022-10-16 12:31:01,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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:31:01,163 INFO L413 NwaCegarLoop]: 2270 mSDtfsCounter, 1055 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 4581 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-10-16 12:31:01,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 4581 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-10-16 12:31:01,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4633 states. [2022-10-16 12:31:01,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4633 to 2546. [2022-10-16 12:31:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 1906 states have (on average 1.4580272822665268) internal successors, (2779), 2028 states have internal predecessors, (2779), 553 states have call successors, (553), 43 states have call predecessors, (553), 43 states have return successors, (553), 548 states have call predecessors, (553), 553 states have call successors, (553) [2022-10-16 12:31:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3885 transitions. [2022-10-16 12:31:01,537 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3885 transitions. Word has length 72 [2022-10-16 12:31:01,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:31:01,538 INFO L495 AbstractCegarLoop]: Abstraction has 2546 states and 3885 transitions. [2022-10-16 12:31:01,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 12:31:01,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3885 transitions. [2022-10-16 12:31:01,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-10-16 12:31:01,541 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:31:01,542 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:31:01,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 12:31:01,542 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:31:01,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:31:01,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2035527323, now seen corresponding path program 1 times [2022-10-16 12:31:01,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:31:01,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379240070] [2022-10-16 12:31:01,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:31:01,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:31:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:31:01,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:31:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:31:01,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:31:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:31:01,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:31:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:31:01,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:31:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:31:01,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:31:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:31:01,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-10-16 12:31:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:31:01,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 12:31:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:31:01,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:31:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:31:01,731 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:31:01,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:31:01,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379240070] [2022-10-16 12:31:01,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379240070] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:31:01,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:31:01,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 12:31:01,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301066630] [2022-10-16 12:31:01,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:31:01,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 12:31:01,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:31:01,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 12:31:01,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 12:31:01,734 INFO L87 Difference]: Start difference. First operand 2546 states and 3885 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 12:31:03,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:31:03,641 INFO L93 Difference]: Finished difference Result 5095 states and 7805 transitions. [2022-10-16 12:31:03,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 12:31:03,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2022-10-16 12:31:03,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:31:03,654 INFO L225 Difference]: With dead ends: 5095 [2022-10-16 12:31:03,654 INFO L226 Difference]: Without dead ends: 2568 [2022-10-16 12:31:03,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 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:31:03,667 INFO L413 NwaCegarLoop]: 1494 mSDtfsCounter, 385 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 3174 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-10-16 12:31:03,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 3174 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-10-16 12:31:03,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2022-10-16 12:31:04,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2550. [2022-10-16 12:31:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2550 states, 1910 states have (on average 1.4570680628272252) internal successors, (2783), 2032 states have internal predecessors, (2783), 553 states have call successors, (553), 43 states have call predecessors, (553), 43 states have return successors, (553), 548 states have call predecessors, (553), 553 states have call successors, (553) [2022-10-16 12:31:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 3889 transitions. [2022-10-16 12:31:04,020 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 3889 transitions. Word has length 76 [2022-10-16 12:31:04,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:31:04,021 INFO L495 AbstractCegarLoop]: Abstraction has 2550 states and 3889 transitions. [2022-10-16 12:31:04,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 12:31:04,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 3889 transitions. [2022-10-16 12:31:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-10-16 12:31:04,025 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:31:04,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:31:04,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-16 12:31:04,027 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:31:04,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:31:04,028 INFO L85 PathProgramCache]: Analyzing trace with hash 979576295, now seen corresponding path program 1 times [2022-10-16 12:31:04,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:31:04,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331487662] [2022-10-16 12:31:04,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:31:04,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:31:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:31:04,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-16 12:31:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:31:04,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:31:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:31:04,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 12:31:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:31:04,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 12:31:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:31:04,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:31:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:31:05,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-10-16 12:31:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:31:05,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 12:31:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:31:05,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 12:31:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 12:31:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 12:31:05,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 12:31:05,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331487662] [2022-10-16 12:31:05,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331487662] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 12:31:05,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 12:31:05,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-10-16 12:31:05,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768611434] [2022-10-16 12:31:05,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 12:31:05,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-16 12:31:05,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 12:31:05,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-16 12:31:05,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-10-16 12:31:05,053 INFO L87 Difference]: Start difference. First operand 2550 states and 3889 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 12:31:09,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 12:31:09,281 INFO L93 Difference]: Finished difference Result 5137 states and 7843 transitions. [2022-10-16 12:31:09,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-16 12:31:09,281 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2022-10-16 12:31:09,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 12:31:09,294 INFO L225 Difference]: With dead ends: 5137 [2022-10-16 12:31:09,294 INFO L226 Difference]: Without dead ends: 2593 [2022-10-16 12:31:09,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-10-16 12:31:09,306 INFO L413 NwaCegarLoop]: 1480 mSDtfsCounter, 431 mSDsluCounter, 7363 mSDsCounter, 0 mSdLazyCounter, 4382 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 8843 SdHoareTripleChecker+Invalid, 4601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 4382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-10-16 12:31:09,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 8843 Invalid, 4601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 4382 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-10-16 12:31:09,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2022-10-16 12:31:09,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2572. [2022-10-16 12:31:09,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2572 states, 1925 states have (on average 1.454025974025974) internal successors, (2799), 2048 states have internal predecessors, (2799), 555 states have call successors, (555), 47 states have call predecessors, (555), 48 states have return successors, (556), 550 states have call predecessors, (556), 555 states have call successors, (556) [2022-10-16 12:31:09,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 3910 transitions. [2022-10-16 12:31:09,661 INFO L78 Accepts]: Start accepts. Automaton has 2572 states and 3910 transitions. Word has length 76 [2022-10-16 12:31:09,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 12:31:09,662 INFO L495 AbstractCegarLoop]: Abstraction has 2572 states and 3910 transitions. [2022-10-16 12:31:09,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 12:31:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2572 states and 3910 transitions. [2022-10-16 12:31:09,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-10-16 12:31:09,665 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 12:31:09,666 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:31:09,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-16 12:31:09,666 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2022-10-16 12:31:09,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 12:31:09,667 INFO L85 PathProgramCache]: Analyzing trace with hash -260089941, now seen corresponding path program 1 times [2022-10-16 12:31:09,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 12:31:09,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757441759] [2022-10-16 12:31:09,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 12:31:09,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 12:31:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 12:31:09,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 12:31:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 12:31:10,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 12:31:10,176 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 12:31:10,178 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 80 remaining) [2022-10-16 12:31:10,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location sl_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 80 remaining) [2022-10-16 12:31:10,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location sl_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 80 remaining) [2022-10-16 12:31:10,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location sl_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 80 remaining) [2022-10-16 12:31:10,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location sl_ioctlErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 80 remaining) [2022-10-16 12:31:10,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location sl_ioctlErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 80 remaining) [2022-10-16 12:31:10,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location sl_ioctlErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 80 remaining) [2022-10-16 12:31:10,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 80 remaining) [2022-10-16 12:31:10,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 80 remaining) [2022-10-16 12:31:10,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 80 remaining) [2022-10-16 12:31:10,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 80 remaining) [2022-10-16 12:31:10,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 80 remaining) [2022-10-16 12:31:10,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 80 remaining) [2022-10-16 12:31:10,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 80 remaining) [2022-10-16 12:31:10,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 80 remaining) [2022-10-16 12:31:10,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 80 remaining) [2022-10-16 12:31:10,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 80 remaining) [2022-10-16 12:31:10,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 80 remaining) [2022-10-16 12:31:10,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 80 remaining) [2022-10-16 12:31:10,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 80 remaining) [2022-10-16 12:31:10,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 80 remaining) [2022-10-16 12:31:10,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 80 remaining) [2022-10-16 12:31:10,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 80 remaining) [2022-10-16 12:31:10,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 80 remaining) [2022-10-16 12:31:10,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 80 remaining) [2022-10-16 12:31:10,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 80 remaining) [2022-10-16 12:31:10,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 80 remaining) [2022-10-16 12:31:10,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 80 remaining) [2022-10-16 12:31:10,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 80 remaining) [2022-10-16 12:31:10,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 80 remaining) [2022-10-16 12:31:10,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 80 remaining) [2022-10-16 12:31:10,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 80 remaining) [2022-10-16 12:31:10,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 80 remaining) [2022-10-16 12:31:10,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 80 remaining) [2022-10-16 12:31:10,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 80 remaining) [2022-10-16 12:31:10,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 80 remaining) [2022-10-16 12:31:10,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 80 remaining) [2022-10-16 12:31:10,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 80 remaining) [2022-10-16 12:31:10,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 80 remaining) [2022-10-16 12:31:10,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 80 remaining) [2022-10-16 12:31:10,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 80 remaining) [2022-10-16 12:31:10,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 80 remaining) [2022-10-16 12:31:10,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 80 remaining) [2022-10-16 12:31:10,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 80 remaining) [2022-10-16 12:31:10,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 80 remaining) [2022-10-16 12:31:10,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 80 remaining) [2022-10-16 12:31:10,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 80 remaining) [2022-10-16 12:31:10,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 80 remaining) [2022-10-16 12:31:10,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 80 remaining) [2022-10-16 12:31:10,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 80 remaining) [2022-10-16 12:31:10,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 80 remaining) [2022-10-16 12:31:10,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 80 remaining) [2022-10-16 12:31:10,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 80 remaining) [2022-10-16 12:31:10,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 80 remaining) [2022-10-16 12:31:10,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 80 remaining) [2022-10-16 12:31:10,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 80 remaining) [2022-10-16 12:31:10,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 80 remaining) [2022-10-16 12:31:10,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 80 remaining) [2022-10-16 12:31:10,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 80 remaining) [2022-10-16 12:31:10,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 80 remaining) [2022-10-16 12:31:10,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 80 remaining) [2022-10-16 12:31:10,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 80 remaining) [2022-10-16 12:31:10,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 80 remaining) [2022-10-16 12:31:10,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 80 remaining) [2022-10-16 12:31:10,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 80 remaining) [2022-10-16 12:31:10,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 80 remaining) [2022-10-16 12:31:10,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 80 remaining) [2022-10-16 12:31:10,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 80 remaining) [2022-10-16 12:31:10,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 80 remaining) [2022-10-16 12:31:10,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 80 remaining) [2022-10-16 12:31:10,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 80 remaining) [2022-10-16 12:31:10,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 80 remaining) [2022-10-16 12:31:10,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 80 remaining) [2022-10-16 12:31:10,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 80 remaining) [2022-10-16 12:31:10,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location sl_bumpErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 80 remaining) [2022-10-16 12:31:10,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location sl_bumpErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 80 remaining) [2022-10-16 12:31:10,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location slip_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 80 remaining) [2022-10-16 12:31:10,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location slip_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 80 remaining) [2022-10-16 12:31:10,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location slip_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 80 remaining) [2022-10-16 12:31:10,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location slip_ioctlErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 80 remaining) [2022-10-16 12:31:10,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-16 12:31:10,208 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 12:31:10,216 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 12:31:10,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:31:10 BoogieIcfgContainer [2022-10-16 12:31:10,362 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 12:31:10,363 INFO L158 Benchmark]: Toolchain (without parser) took 66266.20ms. Allocated memory was 156.2MB in the beginning and 562.0MB in the end (delta: 405.8MB). Free memory was 121.0MB in the beginning and 420.8MB in the end (delta: -299.8MB). Peak memory consumption was 106.1MB. Max. memory is 8.0GB. [2022-10-16 12:31:10,363 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 156.2MB. Free memory was 125.8MB in the beginning and 125.7MB in the end (delta: 84.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 12:31:10,364 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2300.41ms. Allocated memory was 156.2MB in the beginning and 204.5MB in the end (delta: 48.2MB). Free memory was 120.9MB in the beginning and 124.6MB in the end (delta: -3.7MB). Peak memory consumption was 90.9MB. Max. memory is 8.0GB. [2022-10-16 12:31:10,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 332.49ms. Allocated memory is still 204.5MB. Free memory was 124.6MB in the beginning and 147.8MB in the end (delta: -23.2MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. [2022-10-16 12:31:10,364 INFO L158 Benchmark]: Boogie Preprocessor took 235.22ms. Allocated memory is still 204.5MB. Free memory was 147.8MB in the beginning and 130.5MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-10-16 12:31:10,365 INFO L158 Benchmark]: RCFGBuilder took 3898.70ms. Allocated memory was 204.5MB in the beginning and 383.8MB in the end (delta: 179.3MB). Free memory was 130.5MB in the beginning and 311.5MB in the end (delta: -181.0MB). Peak memory consumption was 78.6MB. Max. memory is 8.0GB. [2022-10-16 12:31:10,365 INFO L158 Benchmark]: TraceAbstraction took 59482.15ms. Allocated memory was 383.8MB in the beginning and 562.0MB in the end (delta: 178.3MB). Free memory was 310.5MB in the beginning and 420.8MB in the end (delta: -110.3MB). Peak memory consumption was 67.4MB. Max. memory is 8.0GB. [2022-10-16 12:31:10,368 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.24ms. Allocated memory is still 156.2MB. Free memory was 125.8MB in the beginning and 125.7MB in the end (delta: 84.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2300.41ms. Allocated memory was 156.2MB in the beginning and 204.5MB in the end (delta: 48.2MB). Free memory was 120.9MB in the beginning and 124.6MB in the end (delta: -3.7MB). Peak memory consumption was 90.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 332.49ms. Allocated memory is still 204.5MB. Free memory was 124.6MB in the beginning and 147.8MB in the end (delta: -23.2MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 235.22ms. Allocated memory is still 204.5MB. Free memory was 147.8MB in the beginning and 130.5MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * RCFGBuilder took 3898.70ms. Allocated memory was 204.5MB in the beginning and 383.8MB in the end (delta: 179.3MB). Free memory was 130.5MB in the beginning and 311.5MB in the end (delta: -181.0MB). Peak memory consumption was 78.6MB. Max. memory is 8.0GB. * TraceAbstraction took 59482.15ms. Allocated memory was 383.8MB in the beginning and 562.0MB in the end (delta: 178.3MB). Free memory was 310.5MB in the beginning and 420.8MB in the end (delta: -110.3MB). Peak memory consumption was 67.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - UnprovableResult [Line: 5915]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseOr at line 4873, overapproximation of shiftRight at line 4735, overapproximation of bitwiseAnd at line 4735. Possible FailurePath: [L5034] static struct net_device **slip_devs ; [L5035] static int slip_maxdev = 256; [L5850-L5853] static struct net_device_ops const sl_netdev_ops = {& sl_init, & sl_uninit, & sl_open, & sl_close, & sl_xmit, 0, 0, 0, 0, 0, 0, & sl_ioctl, 0, & sl_change_mtu, 0, & sl_tx_timeout, & sl_get_stats64, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}; [L6723-L6726] static struct tty_ldisc_ops sl_ldisc = {21507, (char *)"slip", 0, 0, & slip_open, & slip_close, 0, 0, 0, 0, & slip_ioctl, & slip_compat_ioctl, 0, 0, & slip_hangup, & slip_receive_buf, & slip_write_wakeup, 0, & __this_module, 0}; [L6910] int LDV_IN_INTERRUPT ; VAL [__this_module={4294967340:4294967336}, LDV_IN_INTERRUPT=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L6913] int res_sl_init_14 ; [L6914] int res_sl_open_11 ; [L6915] int res_sl_close_10 ; [L6916] struct sk_buff *var_group2 ; [L6917] struct rtnl_link_stats64 var_group3 ; [L6918] int var_sl_change_mtu_12_p1 ; [L6919] struct ifreq var_group4 ; [L6920] int var_sl_ioctl_30_p2 ; [L6921] struct tty_struct var_group5 ; [L6922] int res_slip_open_21 ; [L6923] struct file *var_group6 ; [L6924] unsigned int var_slip_ioctl_28_p2 ; [L6925] unsigned long var_slip_ioctl_28_p3 ; [L6926] unsigned int var_slip_compat_ioctl_29_p2 ; [L6927] unsigned long var_slip_compat_ioctl_29_p3 ; [L6928] unsigned char const *var_slip_receive_buf_18_p1 ; [L6929] char *var_slip_receive_buf_18_p2 ; [L6930] int var_slip_receive_buf_18_p3 ; [L6931] unsigned long var_sl_keepalive_34_p0 ; [L6932] unsigned long var_sl_outfill_33_p0 ; [L6933] int ldv_s_sl_netdev_ops_net_device_ops ; [L6934] int ldv_s_sl_ldisc_tty_ldisc_ops ; [L6935] int tmp ; [L6936] int tmp___0 ; [L6937] int tmp___1 ; VAL [__this_module={4294967340:4294967336}, LDV_IN_INTERRUPT=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256, var_group3={31:0}, var_group4={33:0}, var_group5={30:0}] [L6939] CALL, EXPR dev_alloc_skb(1U) VAL [\old(arg0)=1, __this_module={4294967340:4294967336}, LDV_IN_INTERRUPT=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L7186] CALL, EXPR ldv_malloc(sizeof(struct sk_buff)) VAL [\old(size)=195, __this_module={4294967340:4294967336}, LDV_IN_INTERRUPT=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4847] COND FALSE !(__VERIFIER_nondet_int()) [L4852] return ((void *)0); VAL [\old(size)=195, \result={0:0}, __this_module={4294967340:4294967336}, LDV_IN_INTERRUPT=0, size=195, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L7186] RET, EXPR ldv_malloc(sizeof(struct sk_buff)) VAL [\old(arg0)=1, __this_module={4294967340:4294967336}, arg0=1, LDV_IN_INTERRUPT=0, ldv_malloc(sizeof(struct sk_buff))={0:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L7186] return ldv_malloc(sizeof(struct sk_buff)); [L6939] RET, EXPR dev_alloc_skb(1U) VAL [__this_module={4294967340:4294967336}, dev_alloc_skb(1U)={0:0}, LDV_IN_INTERRUPT=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256, var_group3={31:0}, var_group4={33:0}, var_group5={30:0}] [L6939] var_group2 = dev_alloc_skb(1U) [L6940] ldv_s_sl_netdev_ops_net_device_ops = 0 [L6941] ldv_s_sl_ldisc_tty_ldisc_ops = 0 [L6942] LDV_IN_INTERRUPT = 1 [L6943] FCALL ldv_initialize() [L6944] FCALL ldv_handler_precall() VAL [__this_module={4294967340:4294967336}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256, var_group2={0:0}, var_group3={31:0}, var_group4={33:0}, var_group5={30:0}] [L6945] CALL, EXPR slip_init() [L6729] int status ; [L6730] void *tmp ; VAL [__this_module={4294967340:4294967336}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L6732] COND FALSE !(slip_maxdev <= 3) VAL [__this_module={4294967340:4294967336}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L6740] CALL, EXPR kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L4871] void *tmp ; VAL [\old(flags)=208, \old(size)=2048, __this_module={4294967340:4294967336}, flags=208, LDV_IN_INTERRUPT=1, size=2048, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4873] CALL, EXPR kmalloc(size, flags | 32768U) VAL [__this_module={4294967340:4294967336}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4862] void *tmp___2 ; [L4864] CALL, EXPR __kmalloc(size, flags) [L4857] CALL, EXPR ldv_malloc(size) VAL [__this_module={4294967340:4294967336}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4847] COND TRUE __VERIFIER_nondet_int() [L4848] void *res = malloc(size); [L4849] CALL, EXPR ldv_is_err(res) [L4843] return ((unsigned long)ptr > ((unsigned long)-4095)); VAL [\result=0, __this_module={4294967340:4294967336}, LDV_IN_INTERRUPT=1, ptr={-4294971391:0}, ptr={-4294971391:0}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4849] RET, EXPR ldv_is_err(res) [L4849] CALL assume_abort_if_not(!ldv_is_err(res)) [L4838] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={4294967340:4294967336}, cond=1, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4849] RET assume_abort_if_not(!ldv_is_err(res)) [L4850] return res; VAL [\old(size)=2048, \result={-4294971391:0}, __this_module={4294967340:4294967336}, LDV_IN_INTERRUPT=1, res={-4294971391:0}, size=2048, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4857] RET, EXPR ldv_malloc(size) VAL [\old(size)=2048, \old(t)=45, __this_module={4294967340:4294967336}, LDV_IN_INTERRUPT=1, ldv_malloc(size)={-4294971391:0}, size=2048, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256, t=45] [L4857] return ldv_malloc(size); [L4864] RET, EXPR __kmalloc(size, flags) [L4864] tmp___2 = __kmalloc(size, flags) [L4865] return (tmp___2); VAL [\old(flags)=45, \old(size)=2048, \result={-4294971391:0}, __this_module={4294967340:4294967336}, flags=45, LDV_IN_INTERRUPT=1, size=2048, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256, tmp___2={-4294971391:0}] [L4873] RET, EXPR kmalloc(size, flags | 32768U) VAL [\old(flags)=208, \old(size)=2048, __this_module={4294967340:4294967336}, flags=208, kmalloc(size, flags | 32768U)={-4294971391:0}, LDV_IN_INTERRUPT=1, size=2048, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256] [L4873] tmp = kmalloc(size, flags | 32768U) [L4874] return (tmp); VAL [\old(flags)=208, \old(size)=2048, \result={-4294971391:0}, __this_module={4294967340:4294967336}, flags=208, LDV_IN_INTERRUPT=1, size=2048, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={0:0}, slip_maxdev=256, tmp={-4294971391:0}] [L6740] RET, EXPR kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L6740] tmp = kzalloc((unsigned long )slip_maxdev * 8UL, 208U) [L6741] slip_devs = (struct net_device **)tmp VAL [__this_module={4294967340:4294967336}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tmp={-4294971391:0}] [L6742] COND FALSE !((unsigned long )slip_devs == (unsigned long )((struct net_device **)0)) [L6747] CALL, EXPR tty_register_ldisc(1, & sl_ldisc) [L7287] return __VERIFIER_nondet_int(); [L6747] RET, EXPR tty_register_ldisc(1, & sl_ldisc) [L6747] status = tty_register_ldisc(1, & sl_ldisc) [L6748] COND FALSE !(status != 0) VAL [__this_module={4294967340:4294967336}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, status=0, tmp={-4294971391:0}] [L6753] return (status); VAL [\result=0, __this_module={4294967340:4294967336}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, status=0, tmp={-4294971391:0}] [L6945] RET, EXPR slip_init() [L6945] tmp = slip_init() [L6946] COND FALSE !(tmp != 0) VAL [__this_module={4294967340:4294967336}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tmp=0, var_group2={0:0}, var_group3={31:0}, var_group4={33:0}, var_group5={30:0}] [L7076] tmp___1 = __VERIFIER_nondet_int() [L7077] COND TRUE (tmp___1 != 0 || ldv_s_sl_netdev_ops_net_device_ops != 0) || ldv_s_sl_ldisc_tty_ldisc_ops != 0 VAL [__this_module={4294967340:4294967336}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tmp=0, tmp___1=-2, var_group2={0:0}, var_group3={31:0}, var_group4={33:0}, var_group5={30:0}] [L6952] tmp___0 = __VERIFIER_nondet_int() [L6954] case 0: [L6967] case 1: [L6980] case 2: [L6993] case 3: [L7001] case 4: [L7005] case 5: [L7009] case 6: [L7013] case 7: [L7017] case 8: [L7021] case 9: [L7034] case 10: [L7042] case 11: [L7046] case 12: [L7050] case 13: [L7054] case 14: VAL [__this_module={4294967340:4294967336}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tmp=0, tmp___0=14, tmp___1=-2, var_group2={0:0}, var_group3={31:0}, var_group4={33:0}, var_group5={30:0}] [L7055] FCALL ldv_handler_precall() VAL [__this_module={4294967340:4294967336}, LDV_IN_INTERRUPT=1, ldv_s_sl_ldisc_tty_ldisc_ops=0, ldv_s_sl_netdev_ops_net_device_ops=0, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tmp=0, tmp___0=14, tmp___1=-2, var_group2={0:0}, var_group3={31:0}, var_group4={33:0}, var_group5={30:0}] [L7056-L7057] CALL slip_receive_buf(&var_group5, var_slip_receive_buf_18_p1, var_slip_receive_buf_18_p2, var_slip_receive_buf_18_p3) [L5869] struct slip *sl ; [L5870] int tmp ; [L5871] int tmp___0 ; [L5872] char *tmp___1 ; [L5873] unsigned char const *tmp___2 ; [L5874] unsigned char const *tmp___3 ; [L5875] int tmp___4 ; [L5877] EXPR tty->disc_data [L5877] sl = (struct slip *)tty->disc_data [L5878] (unsigned long )sl == (unsigned long )((struct slip *)0) || sl->magic != 21250 [L5878] EXPR sl->magic [L5878] (unsigned long )sl == (unsigned long )((struct slip *)0) || sl->magic != 21250 VAL [(unsigned long )sl == (unsigned long )((struct slip *)0) || sl->magic != 21250=0, \old(count)=2147483649, __this_module={4294967340:4294967336}, count=2147483649, cp={4294967339:4294967337}, cp={4294967339:4294967337}, fp={4294967342:4294967343}, fp={4294967342:4294967343}, LDV_IN_INTERRUPT=1, sl={35:-34}, sl->magic=21250, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tty={30:0}, tty={30:0}] [L5878] COND FALSE !((unsigned long )sl == (unsigned long )((struct slip *)0) || sl->magic != 21250) [L5881] EXPR sl->dev VAL [\old(count)=2147483649, __this_module={4294967340:4294967336}, count=2147483649, cp={4294967339:4294967337}, cp={4294967339:4294967337}, fp={4294967342:4294967343}, fp={4294967342:4294967343}, LDV_IN_INTERRUPT=1, sl={35:-34}, sl->dev={4294967338:-35}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tty={30:0}, tty={30:0}] [L5881] CALL, EXPR netif_running((struct net_device const *)sl->dev) VAL [__this_module={4294967340:4294967336}, dev={4294967338:-35}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256] [L5015] int tmp ; VAL [__this_module={4294967340:4294967336}, dev={4294967338:-35}, dev={4294967338:-35}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256] [L5017] CALL, EXPR constant_test_bit(0U, (unsigned long const volatile *)(& dev->state)) VAL [\old(nr)=0, __this_module={4294967340:4294967336}, addr={4294967338:43}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256] [L4735] EXPR addr + (unsigned long )(nr / 64U) [L4735] return ((int )((unsigned long )*(addr + (unsigned long )(nr / 64U)) >> ((int )nr & 63)) & 1); [L5017] RET, EXPR constant_test_bit(0U, (unsigned long const volatile *)(& dev->state)) VAL [__this_module={4294967340:4294967336}, constant_test_bit(0U, (unsigned long const volatile *)(& dev->state))=-2147483648, dev={4294967338:-35}, dev={4294967338:-35}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256] [L5017] tmp = constant_test_bit(0U, (unsigned long const volatile *)(& dev->state)) [L5018] return (tmp); VAL [\result=-2147483648, __this_module={4294967340:4294967336}, dev={4294967338:-35}, dev={4294967338:-35}, LDV_IN_INTERRUPT=1, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tmp=-2147483648] [L5881] RET, EXPR netif_running((struct net_device const *)sl->dev) VAL [\old(count)=2147483649, __this_module={4294967340:4294967336}, count=2147483649, cp={4294967339:4294967337}, cp={4294967339:4294967337}, fp={4294967342:4294967343}, fp={4294967342:4294967343}, LDV_IN_INTERRUPT=1, netif_running((struct net_device const *)sl->dev)=-2147483648, sl={35:-34}, sl->dev={4294967338:-35}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tty={30:0}, tty={30:0}] [L5881] tmp = netif_running((struct net_device const *)sl->dev) [L5882] COND FALSE !(tmp == 0) VAL [\old(count)=2147483649, __this_module={4294967340:4294967336}, count=2147483649, cp={4294967339:4294967337}, cp={4294967339:4294967337}, fp={4294967342:4294967343}, fp={4294967342:4294967343}, LDV_IN_INTERRUPT=1, sl={35:-34}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tmp=-2147483648, tty={30:0}, tty={30:0}] [L5914] tmp___4 = count VAL [\old(count)=2147483649, __this_module={4294967340:4294967336}, count=2147483649, cp={4294967339:4294967337}, cp={4294967339:4294967337}, fp={4294967342:4294967343}, fp={4294967342:4294967343}, LDV_IN_INTERRUPT=1, sl={35:-34}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tmp=-2147483648, tmp___4=2147483649, tty={30:0}, tty={30:0}] [L5915] count - 1 VAL [\old(count)=2147483649, __this_module={4294967340:4294967336}, count=2147483649, cp={4294967339:4294967337}, cp={4294967339:4294967337}, fp={4294967342:4294967343}, fp={4294967342:4294967343}, LDV_IN_INTERRUPT=1, sl={35:-34}, sl_ldisc={29:0}, sl_netdev_ops={28:0}, slip_devs={-4294971391:0}, slip_maxdev=256, tmp=-2147483648, tmp___4=2147483649, tty={30:0}, tty={30:0}] - UnprovableResult [Line: 6671]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6671]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6672]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6672]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6689]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6689]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6963]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6963]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6976]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6976]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6989]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6989]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6283]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6283]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6297]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6297]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6304]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6304]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6304]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6304]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6192]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6192]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5618]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5618]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5379]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5379]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5384]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5384]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5386]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5386]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5388]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5388]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5673]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5673]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5949]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5949]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5985]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5985]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5080]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5080]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6091]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6091]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6096]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6096]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7030]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7030]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6340]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6340]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6340]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6340]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6341]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6341]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6343]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6343]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6349]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6349]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6250]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6250]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5915]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5648]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5648]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6897]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6897]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6865]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6865]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6790]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6790]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6796]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6796]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6802]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6802]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6824]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6824]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5544]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5544]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6500]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6500]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6575]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6575]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 44 procedures, 1124 locations, 80 error locations. Started 1 CEGAR loops. OverallTime: 59.2s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 48.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 21647 SdHoareTripleChecker+Valid, 42.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19243 mSDsluCounter, 84360 SdHoareTripleChecker+Invalid, 37.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51838 mSDsCounter, 5138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23499 IncrementalHoareTripleChecker+Invalid, 28640 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5138 mSolverCounterUnsat, 32522 mSDtfsCounter, 23499 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 394 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2572occurred in iteration=16, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 16148 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1181 NumberOfCodeBlocks, 1181 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1140 ConstructedInterpolants, 0 QuantifiedInterpolants, 1971 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1251 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 120/137 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-16 12:31:10,437 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...