./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0f8a17c6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 00:53:17,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 00:53:17,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 00:53:17,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 00:53:17,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 00:53:17,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 00:53:17,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 00:53:17,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 00:53:17,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 00:53:17,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 00:53:17,897 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 00:53:17,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 00:53:17,898 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 00:53:17,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 00:53:17,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 00:53:17,904 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 00:53:17,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 00:53:17,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 00:53:17,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 00:53:17,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 00:53:17,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 00:53:17,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 00:53:17,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 00:53:17,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 00:53:17,920 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 00:53:17,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 00:53:17,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 00:53:17,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 00:53:17,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 00:53:17,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 00:53:17,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 00:53:17,923 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 00:53:17,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 00:53:17,925 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 00:53:17,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 00:53:17,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 00:53:17,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 00:53:17,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 00:53:17,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 00:53:17,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 00:53:17,928 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 00:53:17,930 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-17 00:53:17,955 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 00:53:17,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 00:53:17,956 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 00:53:17,956 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 00:53:17,957 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 00:53:17,957 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 00:53:17,957 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 00:53:17,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 00:53:17,958 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 00:53:17,958 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 00:53:17,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-17 00:53:17,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 00:53:17,959 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 00:53:17,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 00:53:17,959 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 00:53:17,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 00:53:17,959 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 00:53:17,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 00:53:17,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 00:53:17,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 00:53:17,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 00:53:17,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 00:53:17,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 00:53:17,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 00:53:17,961 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 00:53:17,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-17 00:53:17,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-17 00:53:17,962 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 00:53:17,962 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 00:53:17,962 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 00:53:17,962 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 00:53:17,962 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 [2021-11-17 00:53:18,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 00:53:18,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 00:53:18,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 00:53:18,182 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 00:53:18,182 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 00:53:18,183 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2021-11-17 00:53:18,252 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e003689e/a8ec141218204fe790def4b4155ab9bf/FLAG7bad76611 [2021-11-17 00:53:18,776 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 00:53:18,776 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2021-11-17 00:53:18,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e003689e/a8ec141218204fe790def4b4155ab9bf/FLAG7bad76611 [2021-11-17 00:53:18,967 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e003689e/a8ec141218204fe790def4b4155ab9bf [2021-11-17 00:53:18,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 00:53:18,970 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 00:53:18,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 00:53:18,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 00:53:18,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 00:53:18,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:53:18" (1/1) ... [2021-11-17 00:53:18,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34821d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:18, skipping insertion in model container [2021-11-17 00:53:18,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:53:18" (1/1) ... [2021-11-17 00:53:18,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 00:53:19,063 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 00:53:19,508 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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2021-11-17 00:53:19,697 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 00:53:19,717 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 00:53:19,829 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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2021-11-17 00:53:19,884 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 00:53:19,908 INFO L208 MainTranslator]: Completed translation [2021-11-17 00:53:19,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:19 WrapperNode [2021-11-17 00:53:19,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 00:53:19,911 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 00:53:19,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 00:53:19,911 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 00:53:19,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:19" (1/1) ... [2021-11-17 00:53:19,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:19" (1/1) ... [2021-11-17 00:53:20,014 INFO L137 Inliner]: procedures = 102, calls = 313, calls flagged for inlining = 35, calls inlined = 32, statements flattened = 967 [2021-11-17 00:53:20,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 00:53:20,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 00:53:20,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 00:53:20,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 00:53:20,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:19" (1/1) ... [2021-11-17 00:53:20,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:19" (1/1) ... [2021-11-17 00:53:20,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:19" (1/1) ... [2021-11-17 00:53:20,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:19" (1/1) ... [2021-11-17 00:53:20,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:19" (1/1) ... [2021-11-17 00:53:20,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:19" (1/1) ... [2021-11-17 00:53:20,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:19" (1/1) ... [2021-11-17 00:53:20,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 00:53:20,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 00:53:20,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 00:53:20,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 00:53:20,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:19" (1/1) ... [2021-11-17 00:53:20,108 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 00:53:20,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:53:20,152 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) [2021-11-17 00:53:20,171 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 [2021-11-17 00:53:20,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-17 00:53:20,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-17 00:53:20,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-17 00:53:20,201 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2021-11-17 00:53:20,201 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2021-11-17 00:53:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 00:53:20,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 00:53:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-17 00:53:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_tx_fixup [2021-11-17 00:53:20,202 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_tx_fixup [2021-11-17 00:53:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2021-11-17 00:53:20,202 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2021-11-17 00:53:20,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-11-17 00:53:20,203 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-11-17 00:53:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2021-11-17 00:53:20,203 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2021-11-17 00:53:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 00:53:20,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 00:53:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_rx_fixup [2021-11-17 00:53:20,203 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_rx_fixup [2021-11-17 00:53:20,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_12 [2021-11-17 00:53:20,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_12 [2021-11-17 00:53:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2021-11-17 00:53:20,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2021-11-17 00:53:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-17 00:53:20,204 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-17 00:53:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-17 00:53:20,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-11-17 00:53:20,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-11-17 00:53:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2021-11-17 00:53:20,205 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2021-11-17 00:53:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-17 00:53:20,205 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-17 00:53:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_skb_return [2021-11-17 00:53:20,205 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_skb_return [2021-11-17 00:53:20,205 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-17 00:53:20,205 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-17 00:53:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 00:53:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 00:53:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 00:53:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 00:53:20,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 00:53:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 00:53:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 00:53:20,207 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2021-11-17 00:53:20,208 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2021-11-17 00:53:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-11-17 00:53:20,208 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-11-17 00:53:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_cmd [2021-11-17 00:53:20,208 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_cmd [2021-11-17 00:53:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-17 00:53:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-17 00:53:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-11-17 00:53:20,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-11-17 00:53:20,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 00:53:20,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 00:53:20,503 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 00:53:20,504 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 00:53:20,703 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 00:53:21,770 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 00:53:21,780 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 00:53:21,782 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-17 00:53:21,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:53:21 BoogieIcfgContainer [2021-11-17 00:53:21,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 00:53:21,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 00:53:21,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 00:53:21,788 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 00:53:21,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:53:18" (1/3) ... [2021-11-17 00:53:21,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a4d50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:53:21, skipping insertion in model container [2021-11-17 00:53:21,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:53:19" (2/3) ... [2021-11-17 00:53:21,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a4d50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:53:21, skipping insertion in model container [2021-11-17 00:53:21,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:53:21" (3/3) ... [2021-11-17 00:53:21,790 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2021-11-17 00:53:21,795 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 00:53:21,796 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-17 00:53:21,838 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 00:53:21,852 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-17 00:53:21,855 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-17 00:53:21,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 301 states, 225 states have (on average 1.3911111111111112) internal successors, (313), 231 states have internal predecessors, (313), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2021-11-17 00:53:21,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-17 00:53:21,883 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:53:21,884 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:53:21,884 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:53:21,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:53:21,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1543576195, now seen corresponding path program 1 times [2021-11-17 00:53:21,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:53:21,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603617970] [2021-11-17 00:53:21,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:21,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:53:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:22,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:53:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:22,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 00:53:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:22,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 00:53:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-17 00:53:22,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:53:22,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603617970] [2021-11-17 00:53:22,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603617970] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:53:22,283 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:53:22,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-17 00:53:22,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628214530] [2021-11-17 00:53:22,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:53:22,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 00:53:22,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:53:22,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 00:53:22,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:53:22,315 INFO L87 Difference]: Start difference. First operand has 301 states, 225 states have (on average 1.3911111111111112) internal successors, (313), 231 states have internal predecessors, (313), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-17 00:53:25,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:53:25,498 INFO L93 Difference]: Finished difference Result 1020 states and 1546 transitions. [2021-11-17 00:53:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:53:25,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2021-11-17 00:53:25,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:53:25,514 INFO L225 Difference]: With dead ends: 1020 [2021-11-17 00:53:25,515 INFO L226 Difference]: Without dead ends: 708 [2021-11-17 00:53:25,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:53:25,530 INFO L933 BasicCegarLoop]: 442 mSDtfsCounter, 800 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-11-17 00:53:25,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [839 Valid, 1244 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2021-11-17 00:53:25,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2021-11-17 00:53:25,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 543. [2021-11-17 00:53:25,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 413 states have (on average 1.3704600484261502) internal successors, (566), 413 states have internal predecessors, (566), 94 states have call successors, (94), 36 states have call predecessors, (94), 35 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2021-11-17 00:53:25,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 753 transitions. [2021-11-17 00:53:25,618 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 753 transitions. Word has length 36 [2021-11-17 00:53:25,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:53:25,619 INFO L470 AbstractCegarLoop]: Abstraction has 543 states and 753 transitions. [2021-11-17 00:53:25,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-17 00:53:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 753 transitions. [2021-11-17 00:53:25,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-17 00:53:25,622 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:53:25,622 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-17 00:53:25,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-17 00:53:25,623 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:53:25,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:53:25,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1367673217, now seen corresponding path program 1 times [2021-11-17 00:53:25,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:53:25,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951548765] [2021-11-17 00:53:25,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:25,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:53:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:25,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:53:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:25,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 00:53:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:25,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 00:53:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:25,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:53:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-17 00:53:25,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:53:25,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951548765] [2021-11-17 00:53:25,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951548765] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:53:25,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:53:25,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 00:53:25,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955627408] [2021-11-17 00:53:25,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:53:25,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 00:53:25,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:53:25,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 00:53:25,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:53:25,763 INFO L87 Difference]: Start difference. First operand 543 states and 753 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-17 00:53:27,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:53:27,994 INFO L93 Difference]: Finished difference Result 1925 states and 2801 transitions. [2021-11-17 00:53:27,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 00:53:27,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2021-11-17 00:53:27,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:53:28,017 INFO L225 Difference]: With dead ends: 1925 [2021-11-17 00:53:28,018 INFO L226 Difference]: Without dead ends: 1390 [2021-11-17 00:53:28,021 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-17 00:53:28,022 INFO L933 BasicCegarLoop]: 514 mSDtfsCounter, 799 mSDsluCounter, 1885 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 2399 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-11-17 00:53:28,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [838 Valid, 2399 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-11-17 00:53:28,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2021-11-17 00:53:28,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1133. [2021-11-17 00:53:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 867 states have (on average 1.3737024221453287) internal successors, (1191), 869 states have internal predecessors, (1191), 188 states have call successors, (188), 70 states have call predecessors, (188), 77 states have return successors, (215), 193 states have call predecessors, (215), 187 states have call successors, (215) [2021-11-17 00:53:28,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1594 transitions. [2021-11-17 00:53:28,098 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1594 transitions. Word has length 46 [2021-11-17 00:53:28,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:53:28,099 INFO L470 AbstractCegarLoop]: Abstraction has 1133 states and 1594 transitions. [2021-11-17 00:53:28,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-17 00:53:28,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1594 transitions. [2021-11-17 00:53:28,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-17 00:53:28,109 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:53:28,109 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:53:28,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-17 00:53:28,110 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:53:28,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:53:28,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1207773749, now seen corresponding path program 1 times [2021-11-17 00:53:28,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:53:28,111 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782156159] [2021-11-17 00:53:28,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:28,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:53:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:28,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:53:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:28,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 00:53:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:28,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 00:53:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:28,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:53:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:28,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:53:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:28,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:28,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:28,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 00:53:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-17 00:53:28,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:53:28,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782156159] [2021-11-17 00:53:28,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782156159] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:53:28,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:53:28,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 00:53:28,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246887522] [2021-11-17 00:53:28,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:53:28,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 00:53:28,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:53:28,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 00:53:28,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-17 00:53:28,262 INFO L87 Difference]: Start difference. First operand 1133 states and 1594 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 00:53:29,303 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:53:30,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:53:30,727 INFO L93 Difference]: Finished difference Result 2745 states and 3951 transitions. [2021-11-17 00:53:30,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-17 00:53:30,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2021-11-17 00:53:30,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:53:30,735 INFO L225 Difference]: With dead ends: 2745 [2021-11-17 00:53:30,735 INFO L226 Difference]: Without dead ends: 1626 [2021-11-17 00:53:30,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:53:30,740 INFO L933 BasicCegarLoop]: 395 mSDtfsCounter, 238 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-17 00:53:30,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 1328 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-17 00:53:30,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2021-11-17 00:53:30,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1354. [2021-11-17 00:53:30,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1065 states have (on average 1.3934272300469484) internal successors, (1484), 1067 states have internal predecessors, (1484), 201 states have call successors, (201), 80 states have call predecessors, (201), 87 states have return successors, (228), 206 states have call predecessors, (228), 200 states have call successors, (228) [2021-11-17 00:53:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 1913 transitions. [2021-11-17 00:53:30,837 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 1913 transitions. Word has length 84 [2021-11-17 00:53:30,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:53:30,837 INFO L470 AbstractCegarLoop]: Abstraction has 1354 states and 1913 transitions. [2021-11-17 00:53:30,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-11-17 00:53:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 1913 transitions. [2021-11-17 00:53:30,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-17 00:53:30,844 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:53:30,844 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:53:30,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-17 00:53:30,845 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:53:30,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:53:30,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1259796470, now seen corresponding path program 1 times [2021-11-17 00:53:30,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:53:30,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21031289] [2021-11-17 00:53:30,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:30,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:53:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:30,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:53:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:30,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 00:53:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:30,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 00:53:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:31,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:53:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:31,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 00:53:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:31,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:53:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:31,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 00:53:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:31,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-11-17 00:53:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:31,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:53:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:31,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:31,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:31,068 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-17 00:53:31,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:53:31,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21031289] [2021-11-17 00:53:31,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21031289] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:53:31,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:53:31,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-17 00:53:31,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612117020] [2021-11-17 00:53:31,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:53:31,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-17 00:53:31,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:53:31,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-17 00:53:31,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-17 00:53:31,070 INFO L87 Difference]: Start difference. First operand 1354 states and 1913 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-17 00:53:32,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:53:32,799 INFO L93 Difference]: Finished difference Result 3951 states and 5677 transitions. [2021-11-17 00:53:32,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-17 00:53:32,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 112 [2021-11-17 00:53:32,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:53:32,810 INFO L225 Difference]: With dead ends: 3951 [2021-11-17 00:53:32,811 INFO L226 Difference]: Without dead ends: 2622 [2021-11-17 00:53:32,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:53:32,815 INFO L933 BasicCegarLoop]: 517 mSDtfsCounter, 686 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-17 00:53:32,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [723 Valid, 1401 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-17 00:53:32,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2021-11-17 00:53:32,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 2120. [2021-11-17 00:53:32,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2120 states, 1669 states have (on average 1.3768723786698622) internal successors, (2298), 1673 states have internal predecessors, (2298), 303 states have call successors, (303), 132 states have call predecessors, (303), 147 states have return successors, (347), 314 states have call predecessors, (347), 302 states have call successors, (347) [2021-11-17 00:53:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 2948 transitions. [2021-11-17 00:53:32,883 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 2948 transitions. Word has length 112 [2021-11-17 00:53:32,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:53:32,885 INFO L470 AbstractCegarLoop]: Abstraction has 2120 states and 2948 transitions. [2021-11-17 00:53:32,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-11-17 00:53:32,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 2948 transitions. [2021-11-17 00:53:32,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-17 00:53:32,892 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:53:32,893 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:53:32,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-17 00:53:32,893 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:53:32,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:53:32,893 INFO L85 PathProgramCache]: Analyzing trace with hash 257111116, now seen corresponding path program 1 times [2021-11-17 00:53:32,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:53:32,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526832235] [2021-11-17 00:53:32,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:32,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:53:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:32,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:53:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:32,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 00:53:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:33,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 00:53:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:33,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:53:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:33,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 00:53:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:33,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:53:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:33,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 00:53:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:33,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 00:53:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:33,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:53:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:33,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:33,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-11-17 00:53:33,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:53:33,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526832235] [2021-11-17 00:53:33,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526832235] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:53:33,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:53:33,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-17 00:53:33,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037439046] [2021-11-17 00:53:33,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:53:33,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 00:53:33,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:53:33,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 00:53:33,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-11-17 00:53:33,189 INFO L87 Difference]: Start difference. First operand 2120 states and 2948 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-17 00:53:34,201 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:53:35,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:53:35,862 INFO L93 Difference]: Finished difference Result 4700 states and 6784 transitions. [2021-11-17 00:53:35,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-17 00:53:35,862 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2021-11-17 00:53:35,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:53:35,872 INFO L225 Difference]: With dead ends: 4700 [2021-11-17 00:53:35,872 INFO L226 Difference]: Without dead ends: 2605 [2021-11-17 00:53:35,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-11-17 00:53:35,879 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 275 mSDsluCounter, 2136 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-11-17 00:53:35,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [281 Valid, 2523 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-11-17 00:53:35,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2021-11-17 00:53:35,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 2120. [2021-11-17 00:53:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2120 states, 1661 states have (on average 1.3690547862733293) internal successors, (2274), 1669 states have internal predecessors, (2274), 303 states have call successors, (303), 132 states have call predecessors, (303), 155 states have return successors, (360), 318 states have call predecessors, (360), 302 states have call successors, (360) [2021-11-17 00:53:35,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 2937 transitions. [2021-11-17 00:53:35,948 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 2937 transitions. Word has length 112 [2021-11-17 00:53:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:53:35,949 INFO L470 AbstractCegarLoop]: Abstraction has 2120 states and 2937 transitions. [2021-11-17 00:53:35,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-17 00:53:35,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 2937 transitions. [2021-11-17 00:53:35,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-17 00:53:35,953 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:53:35,953 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:53:35,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-17 00:53:35,953 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:53:35,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:53:35,954 INFO L85 PathProgramCache]: Analyzing trace with hash 473324826, now seen corresponding path program 1 times [2021-11-17 00:53:35,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:53:35,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260584686] [2021-11-17 00:53:35,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:35,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:53:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:36,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:53:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:36,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 00:53:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:36,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 00:53:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:36,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:53:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:36,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 00:53:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:36,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:53:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:36,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 00:53:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:36,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 00:53:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:36,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 00:53:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:36,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:36,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:53:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:36,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:36,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:36,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:53:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-11-17 00:53:36,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:53:36,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260584686] [2021-11-17 00:53:36,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260584686] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:53:36,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:53:36,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-17 00:53:36,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504445473] [2021-11-17 00:53:36,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:53:36,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 00:53:36,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:53:36,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 00:53:36,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:53:36,154 INFO L87 Difference]: Start difference. First operand 2120 states and 2937 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 00:53:37,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:53:37,542 INFO L93 Difference]: Finished difference Result 5060 states and 7313 transitions. [2021-11-17 00:53:37,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-17 00:53:37,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2021-11-17 00:53:37,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:53:37,554 INFO L225 Difference]: With dead ends: 5060 [2021-11-17 00:53:37,554 INFO L226 Difference]: Without dead ends: 2965 [2021-11-17 00:53:37,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-11-17 00:53:37,559 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 396 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-11-17 00:53:37,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 1250 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-11-17 00:53:37,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2021-11-17 00:53:37,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2308. [2021-11-17 00:53:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2308 states, 1781 states have (on average 1.3599101628298709) internal successors, (2422), 1797 states have internal predecessors, (2422), 359 states have call successors, (359), 132 states have call predecessors, (359), 167 states have return successors, (494), 378 states have call predecessors, (494), 358 states have call successors, (494) [2021-11-17 00:53:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 3275 transitions. [2021-11-17 00:53:37,630 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 3275 transitions. Word has length 137 [2021-11-17 00:53:37,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:53:37,631 INFO L470 AbstractCegarLoop]: Abstraction has 2308 states and 3275 transitions. [2021-11-17 00:53:37,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 00:53:37,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 3275 transitions. [2021-11-17 00:53:37,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-11-17 00:53:37,634 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:53:37,634 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:53:37,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-17 00:53:37,634 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:53:37,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:53:37,635 INFO L85 PathProgramCache]: Analyzing trace with hash 917225500, now seen corresponding path program 1 times [2021-11-17 00:53:37,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:53:37,635 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66745697] [2021-11-17 00:53:37,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:37,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:53:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:37,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:53:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:37,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 00:53:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:37,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 00:53:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:37,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:53:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:37,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 00:53:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:37,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:53:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:37,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 00:53:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:37,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 00:53:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:37,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 00:53:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:37,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:37,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:53:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:37,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:37,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:37,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:53:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2021-11-17 00:53:37,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:53:37,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66745697] [2021-11-17 00:53:37,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66745697] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:53:37,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:53:37,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-11-17 00:53:37,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169650757] [2021-11-17 00:53:37,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:53:37,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-17 00:53:37,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:53:37,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-17 00:53:37,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2021-11-17 00:53:37,959 INFO L87 Difference]: Start difference. First operand 2308 states and 3275 transitions. Second operand has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 8 states have internal predecessors, (90), 3 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 00:53:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:53:40,166 INFO L93 Difference]: Finished difference Result 5240 states and 7675 transitions. [2021-11-17 00:53:40,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-17 00:53:40,173 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 8 states have internal predecessors, (90), 3 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2021-11-17 00:53:40,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:53:40,186 INFO L225 Difference]: With dead ends: 5240 [2021-11-17 00:53:40,186 INFO L226 Difference]: Without dead ends: 2957 [2021-11-17 00:53:40,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2021-11-17 00:53:40,195 INFO L933 BasicCegarLoop]: 403 mSDtfsCounter, 334 mSDsluCounter, 3513 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 3916 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-17 00:53:40,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 3916 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-17 00:53:40,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2021-11-17 00:53:40,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2316. [2021-11-17 00:53:40,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2316 states, 1789 states have (on average 1.3515930687534936) internal successors, (2418), 1801 states have internal predecessors, (2418), 359 states have call successors, (359), 132 states have call predecessors, (359), 167 states have return successors, (494), 382 states have call predecessors, (494), 358 states have call successors, (494) [2021-11-17 00:53:40,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 3271 transitions. [2021-11-17 00:53:40,271 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 3271 transitions. Word has length 137 [2021-11-17 00:53:40,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:53:40,271 INFO L470 AbstractCegarLoop]: Abstraction has 2316 states and 3271 transitions. [2021-11-17 00:53:40,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.428571428571429) internal successors, (90), 8 states have internal predecessors, (90), 3 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 00:53:40,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 3271 transitions. [2021-11-17 00:53:40,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-11-17 00:53:40,275 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:53:40,275 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:53:40,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-17 00:53:40,275 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:53:40,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:53:40,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2050394968, now seen corresponding path program 1 times [2021-11-17 00:53:40,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:53:40,276 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775655481] [2021-11-17 00:53:40,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:40,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:53:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:40,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:53:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:40,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 00:53:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:40,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-11-17 00:53:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:40,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-17 00:53:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:40,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-11-17 00:53:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:40,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-17 00:53:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:40,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-17 00:53:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:40,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-11-17 00:53:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:40,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 00:53:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:40,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:40,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:53:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:40,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:40,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:40,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:53:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:40,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 00:53:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:40,503 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-11-17 00:53:40,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:53:40,503 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775655481] [2021-11-17 00:53:40,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775655481] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:53:40,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960132454] [2021-11-17 00:53:40,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:40,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:53:40,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:53:40,505 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) [2021-11-17 00:53:40,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-17 00:53:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:40,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-17 00:53:40,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:53:41,125 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-17 00:53:41,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-17 00:53:41,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960132454] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:53:41,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 00:53:41,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2021-11-17 00:53:41,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555647698] [2021-11-17 00:53:41,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:53:41,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:53:41,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:53:41,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:53:41,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-11-17 00:53:41,127 INFO L87 Difference]: Start difference. First operand 2316 states and 3271 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 00:53:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:53:41,188 INFO L93 Difference]: Finished difference Result 4617 states and 6527 transitions. [2021-11-17 00:53:41,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 00:53:41,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 143 [2021-11-17 00:53:41,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:53:41,197 INFO L225 Difference]: With dead ends: 4617 [2021-11-17 00:53:41,197 INFO L226 Difference]: Without dead ends: 2317 [2021-11-17 00:53:41,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-17 00:53:41,204 INFO L933 BasicCegarLoop]: 398 mSDtfsCounter, 2 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 00:53:41,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1191 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 00:53:41,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2021-11-17 00:53:41,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2317. [2021-11-17 00:53:41,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 1790 states have (on average 1.3513966480446928) internal successors, (2419), 1802 states have internal predecessors, (2419), 359 states have call successors, (359), 132 states have call predecessors, (359), 167 states have return successors, (494), 382 states have call predecessors, (494), 358 states have call successors, (494) [2021-11-17 00:53:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 3272 transitions. [2021-11-17 00:53:41,273 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 3272 transitions. Word has length 143 [2021-11-17 00:53:41,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:53:41,273 INFO L470 AbstractCegarLoop]: Abstraction has 2317 states and 3272 transitions. [2021-11-17 00:53:41,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 00:53:41,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 3272 transitions. [2021-11-17 00:53:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-11-17 00:53:41,277 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:53:41,277 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:53:41,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-17 00:53:41,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:53:41,489 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:53:41,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:53:41,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1093003820, now seen corresponding path program 1 times [2021-11-17 00:53:41,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:53:41,489 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932147082] [2021-11-17 00:53:41,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:41,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:53:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:41,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:53:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:41,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 00:53:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:41,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-11-17 00:53:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:41,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-17 00:53:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:41,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-17 00:53:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:41,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 00:53:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:41,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 00:53:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:41,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 00:53:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:41,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:53:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:41,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:41,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:41,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:53:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:41,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 00:53:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-11-17 00:53:41,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:53:41,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932147082] [2021-11-17 00:53:41,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932147082] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:53:41,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408375381] [2021-11-17 00:53:41,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:41,737 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:53:41,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:53:41,752 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) [2021-11-17 00:53:41,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-17 00:53:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:42,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-17 00:53:42,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:53:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-17 00:53:42,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:53:42,571 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2021-11-17 00:53:42,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408375381] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 00:53:42,571 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-17 00:53:42,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2021-11-17 00:53:42,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608976668] [2021-11-17 00:53:42,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-17 00:53:42,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-17 00:53:42,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:53:42,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-17 00:53:42,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-11-17 00:53:42,573 INFO L87 Difference]: Start difference. First operand 2317 states and 3272 transitions. Second operand has 14 states, 14 states have (on average 9.214285714285714) internal successors, (129), 10 states have internal predecessors, (129), 2 states have call successors, (37), 6 states have call predecessors, (37), 5 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 00:53:44,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:53:44,781 INFO L93 Difference]: Finished difference Result 5261 states and 7592 transitions. [2021-11-17 00:53:44,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-17 00:53:44,782 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.214285714285714) internal successors, (129), 10 states have internal predecessors, (129), 2 states have call successors, (37), 6 states have call predecessors, (37), 5 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 127 [2021-11-17 00:53:44,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:53:44,795 INFO L225 Difference]: With dead ends: 5261 [2021-11-17 00:53:44,795 INFO L226 Difference]: Without dead ends: 2958 [2021-11-17 00:53:44,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 269 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-11-17 00:53:44,802 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 175 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1738 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-11-17 00:53:44,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 1738 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-11-17 00:53:44,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2021-11-17 00:53:44,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2320. [2021-11-17 00:53:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2320 states, 1793 states have (on average 1.350808700501952) internal successors, (2422), 1805 states have internal predecessors, (2422), 359 states have call successors, (359), 132 states have call predecessors, (359), 167 states have return successors, (494), 382 states have call predecessors, (494), 358 states have call successors, (494) [2021-11-17 00:53:44,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 3275 transitions. [2021-11-17 00:53:44,900 INFO L78 Accepts]: Start accepts. Automaton has 2320 states and 3275 transitions. Word has length 127 [2021-11-17 00:53:44,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:53:44,900 INFO L470 AbstractCegarLoop]: Abstraction has 2320 states and 3275 transitions. [2021-11-17 00:53:44,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.214285714285714) internal successors, (129), 10 states have internal predecessors, (129), 2 states have call successors, (37), 6 states have call predecessors, (37), 5 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2021-11-17 00:53:44,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2320 states and 3275 transitions. [2021-11-17 00:53:44,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-11-17 00:53:44,903 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:53:44,904 INFO L514 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:53:44,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-17 00:53:45,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-17 00:53:45,120 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:53:45,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:53:45,120 INFO L85 PathProgramCache]: Analyzing trace with hash -660711512, now seen corresponding path program 1 times [2021-11-17 00:53:45,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:53:45,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947360688] [2021-11-17 00:53:45,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:45,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:53:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:45,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:53:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:45,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 00:53:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:45,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:53:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:45,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:53:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:45,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 00:53:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:45,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 00:53:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:45,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 00:53:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:45,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-17 00:53:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:45,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 00:53:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:45,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:45,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:53:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:45,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:45,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:45,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:53:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:45,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 00:53:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-11-17 00:53:45,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:53:45,854 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947360688] [2021-11-17 00:53:45,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947360688] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:53:45,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:53:45,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-11-17 00:53:45,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980471841] [2021-11-17 00:53:45,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:53:45,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-11-17 00:53:45,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:53:45,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-17 00:53:45,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2021-11-17 00:53:45,856 INFO L87 Difference]: Start difference. First operand 2320 states and 3275 transitions. Second operand has 20 states, 19 states have (on average 4.842105263157895) internal successors, (92), 12 states have internal predecessors, (92), 4 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-17 00:53:48,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:53:48,949 INFO L93 Difference]: Finished difference Result 5513 states and 8066 transitions. [2021-11-17 00:53:48,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-17 00:53:48,950 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.842105263157895) internal successors, (92), 12 states have internal predecessors, (92), 4 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 3 states have call successors, (15) Word has length 151 [2021-11-17 00:53:48,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:53:48,960 INFO L225 Difference]: With dead ends: 5513 [2021-11-17 00:53:48,961 INFO L226 Difference]: Without dead ends: 3222 [2021-11-17 00:53:48,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2021-11-17 00:53:48,966 INFO L933 BasicCegarLoop]: 442 mSDtfsCounter, 196 mSDsluCounter, 6207 mSDsCounter, 0 mSdLazyCounter, 2124 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 6649 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 2124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-11-17 00:53:48,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 6649 Invalid, 2237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 2124 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-11-17 00:53:48,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3222 states. [2021-11-17 00:53:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3222 to 2372. [2021-11-17 00:53:49,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2372 states, 1833 states have (on average 1.343153300600109) internal successors, (2462), 1841 states have internal predecessors, (2462), 363 states have call successors, (363), 132 states have call predecessors, (363), 175 states have return successors, (522), 398 states have call predecessors, (522), 362 states have call successors, (522) [2021-11-17 00:53:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 3347 transitions. [2021-11-17 00:53:49,064 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 3347 transitions. Word has length 151 [2021-11-17 00:53:49,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:53:49,064 INFO L470 AbstractCegarLoop]: Abstraction has 2372 states and 3347 transitions. [2021-11-17 00:53:49,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.842105263157895) internal successors, (92), 12 states have internal predecessors, (92), 4 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 3 states have call successors, (15) [2021-11-17 00:53:49,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 3347 transitions. [2021-11-17 00:53:49,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-11-17 00:53:49,067 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:53:49,068 INFO L514 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:53:49,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-17 00:53:49,068 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:53:49,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:53:49,069 INFO L85 PathProgramCache]: Analyzing trace with hash 921632664, now seen corresponding path program 2 times [2021-11-17 00:53:49,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:53:49,069 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343644037] [2021-11-17 00:53:49,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:49,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:53:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:49,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:53:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:49,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 00:53:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:49,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:53:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:49,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:53:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:49,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 00:53:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:49,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 00:53:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:49,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 00:53:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:49,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-17 00:53:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:49,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:53:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:49,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:49,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:49,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:53:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:49,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 00:53:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-11-17 00:53:49,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:53:49,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343644037] [2021-11-17 00:53:49,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343644037] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-17 00:53:49,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:53:49,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-17 00:53:49,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988336469] [2021-11-17 00:53:49,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:53:49,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-17 00:53:49,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:53:49,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-17 00:53:49,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2021-11-17 00:53:49,505 INFO L87 Difference]: Start difference. First operand 2372 states and 3347 transitions. Second operand has 18 states, 18 states have (on average 4.5) internal successors, (81), 10 states have internal predecessors, (81), 3 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 00:53:51,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:53:51,728 INFO L93 Difference]: Finished difference Result 5493 states and 7958 transitions. [2021-11-17 00:53:51,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-17 00:53:51,729 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 10 states have internal predecessors, (81), 3 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 2 states have call successors, (13) Word has length 133 [2021-11-17 00:53:51,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:53:51,748 INFO L225 Difference]: With dead ends: 5493 [2021-11-17 00:53:51,748 INFO L226 Difference]: Without dead ends: 3150 [2021-11-17 00:53:51,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2021-11-17 00:53:51,754 INFO L933 BasicCegarLoop]: 459 mSDtfsCounter, 278 mSDsluCounter, 5399 mSDsCounter, 0 mSdLazyCounter, 1729 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 5858 SdHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-11-17 00:53:51,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [304 Valid, 5858 Invalid, 1944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1729 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-11-17 00:53:51,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3150 states. [2021-11-17 00:53:51,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 2388. [2021-11-17 00:53:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2388 states, 1849 states have (on average 1.3401838831800974) internal successors, (2478), 1849 states have internal predecessors, (2478), 363 states have call successors, (363), 132 states have call predecessors, (363), 175 states have return successors, (522), 406 states have call predecessors, (522), 362 states have call successors, (522) [2021-11-17 00:53:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 3363 transitions. [2021-11-17 00:53:51,841 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 3363 transitions. Word has length 133 [2021-11-17 00:53:51,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:53:51,842 INFO L470 AbstractCegarLoop]: Abstraction has 2388 states and 3363 transitions. [2021-11-17 00:53:51,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 10 states have internal predecessors, (81), 3 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 00:53:51,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 3363 transitions. [2021-11-17 00:53:51,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-11-17 00:53:51,847 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:53:51,847 INFO L514 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:53:51,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-17 00:53:51,847 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:53:51,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:53:51,848 INFO L85 PathProgramCache]: Analyzing trace with hash -796082131, now seen corresponding path program 1 times [2021-11-17 00:53:51,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-17 00:53:51,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622994474] [2021-11-17 00:53:51,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:51,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-17 00:53:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:51,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-17 00:53:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:51,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-11-17 00:53:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:51,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:53:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:52,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-11-17 00:53:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:52,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-11-17 00:53:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:52,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-11-17 00:53:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:52,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-11-17 00:53:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:52,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2021-11-17 00:53:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:52,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-11-17 00:53:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:52,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:52,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-17 00:53:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:52,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:52,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:53,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-17 00:53:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:53,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-17 00:53:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:53,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-11-17 00:53:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:53,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-11-17 00:53:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:53,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-17 00:53:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:53,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-17 00:53:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:53,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-17 00:53:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2021-11-17 00:53:53,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-17 00:53:53,310 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622994474] [2021-11-17 00:53:53,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622994474] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-17 00:53:53,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906205797] [2021-11-17 00:53:53,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:53:53,311 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:53:53,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:53:53,312 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 00:53:53,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-17 00:53:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:53:53,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 65 conjunts are in the unsatisfiable core [2021-11-17 00:53:53,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:53:58,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-11-17 00:54:34,977 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Index 1 out of bounds for length 1 [2021-11-17 00:54:34,977 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-17 00:54:34,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2021-11-17 00:54:34,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136993783] [2021-11-17 00:54:34,978 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-17 00:54:34,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-17 00:54:34,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-17 00:54:34,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-17 00:54:34,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2649, Unknown=18, NotChecked=0, Total=2862 [2021-11-17 00:54:34,979 INFO L87 Difference]: Start difference. First operand 2388 states and 3363 transitions. Second operand has 36 states, 36 states have (on average 3.0833333333333335) internal successors, (111), 27 states have internal predecessors, (111), 13 states have call successors, (20), 6 states have call predecessors, (20), 8 states have return successors, (19), 15 states have call predecessors, (19), 12 states have call successors, (19) [2021-11-17 00:54:34,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-17 00:54:35,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 41.5s TimeCoverageRelationStatistics Valid=195, Invalid=2649, Unknown=18, NotChecked=0, Total=2862 [2021-11-17 00:54:35,001 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 00:54:35,001 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 00:54:35,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-17 00:54:35,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:54:35,214 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@f84022c at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:359) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-17 00:54:35,219 INFO L158 Benchmark]: Toolchain (without parser) took 76248.85ms. Allocated memory was 144.7MB in the beginning and 534.8MB in the end (delta: 390.1MB). Free memory was 116.4MB in the beginning and 461.6MB in the end (delta: -345.2MB). Peak memory consumption was 347.0MB. Max. memory is 16.1GB. [2021-11-17 00:54:35,219 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 144.7MB. Free memory was 103.1MB in the beginning and 103.1MB in the end (delta: 75.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-17 00:54:35,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 939.45ms. Allocated memory was 144.7MB in the beginning and 211.8MB in the end (delta: 67.1MB). Free memory was 116.4MB in the beginning and 148.5MB in the end (delta: -32.1MB). Peak memory consumption was 63.0MB. Max. memory is 16.1GB. [2021-11-17 00:54:35,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.55ms. Allocated memory is still 211.8MB. Free memory was 148.5MB in the beginning and 141.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-17 00:54:35,219 INFO L158 Benchmark]: Boogie Preprocessor took 76.23ms. Allocated memory is still 211.8MB. Free memory was 141.2MB in the beginning and 133.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-17 00:54:35,220 INFO L158 Benchmark]: RCFGBuilder took 1688.38ms. Allocated memory is still 211.8MB. Free memory was 133.8MB in the beginning and 139.2MB in the end (delta: -5.3MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. [2021-11-17 00:54:35,220 INFO L158 Benchmark]: TraceAbstraction took 73433.06ms. Allocated memory was 211.8MB in the beginning and 534.8MB in the end (delta: 323.0MB). Free memory was 138.1MB in the beginning and 461.6MB in the end (delta: -323.5MB). Peak memory consumption was 303.0MB. Max. memory is 16.1GB. [2021-11-17 00:54:35,223 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.17ms. Allocated memory is still 144.7MB. Free memory was 103.1MB in the beginning and 103.1MB in the end (delta: 75.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 939.45ms. Allocated memory was 144.7MB in the beginning and 211.8MB in the end (delta: 67.1MB). Free memory was 116.4MB in the beginning and 148.5MB in the end (delta: -32.1MB). Peak memory consumption was 63.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.55ms. Allocated memory is still 211.8MB. Free memory was 148.5MB in the beginning and 141.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.23ms. Allocated memory is still 211.8MB. Free memory was 141.2MB in the beginning and 133.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1688.38ms. Allocated memory is still 211.8MB. Free memory was 133.8MB in the beginning and 139.2MB in the end (delta: -5.3MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. * TraceAbstraction took 73433.06ms. Allocated memory was 211.8MB in the beginning and 534.8MB in the end (delta: 323.0MB). Free memory was 138.1MB in the beginning and 461.6MB in the end (delta: -323.5MB). Peak memory consumption was 303.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@f84022c de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@f84022c: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-17 00:54:35,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-0f8a17c [2021-11-17 00:54:37,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-17 00:54:37,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-17 00:54:37,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-17 00:54:37,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-17 00:54:37,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-17 00:54:37,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-17 00:54:37,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-17 00:54:37,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-17 00:54:37,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-17 00:54:37,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-17 00:54:37,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-17 00:54:37,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-17 00:54:37,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-17 00:54:37,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-17 00:54:37,144 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-17 00:54:37,145 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-17 00:54:37,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-17 00:54:37,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-17 00:54:37,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-17 00:54:37,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-17 00:54:37,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-17 00:54:37,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-17 00:54:37,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-17 00:54:37,161 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-17 00:54:37,161 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-17 00:54:37,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-17 00:54:37,163 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-17 00:54:37,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-17 00:54:37,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-17 00:54:37,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-17 00:54:37,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-17 00:54:37,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-17 00:54:37,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-17 00:54:37,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-17 00:54:37,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-17 00:54:37,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-17 00:54:37,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-17 00:54:37,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-17 00:54:37,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-17 00:54:37,171 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-17 00:54:37,172 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-17 00:54:37,203 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-17 00:54:37,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-17 00:54:37,204 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-17 00:54:37,204 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-17 00:54:37,205 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-17 00:54:37,205 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-17 00:54:37,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-17 00:54:37,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-17 00:54:37,207 INFO L138 SettingsManager]: * Use SBE=true [2021-11-17 00:54:37,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-17 00:54:37,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-17 00:54:37,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-17 00:54:37,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-17 00:54:37,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-17 00:54:37,208 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-17 00:54:37,208 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-17 00:54:37,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-17 00:54:37,208 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-17 00:54:37,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-17 00:54:37,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-17 00:54:37,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-17 00:54:37,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-17 00:54:37,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 00:54:37,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-17 00:54:37,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-17 00:54:37,210 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-17 00:54:37,210 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-17 00:54:37,210 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-17 00:54:37,210 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-17 00:54:37,210 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-17 00:54:37,211 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-17 00:54:37,211 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-17 00:54:37,211 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-17 00:54:37,211 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 [2021-11-17 00:54:37,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-17 00:54:37,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-17 00:54:37,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-17 00:54:37,468 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-17 00:54:37,469 INFO L275 PluginConnector]: CDTParser initialized [2021-11-17 00:54:37,470 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2021-11-17 00:54:37,511 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90abbed62/465397b40552461dbaf0ef6f4bdcd705/FLAGbc11ea77c [2021-11-17 00:54:38,036 INFO L306 CDTParser]: Found 1 translation units. [2021-11-17 00:54:38,037 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2021-11-17 00:54:38,062 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90abbed62/465397b40552461dbaf0ef6f4bdcd705/FLAGbc11ea77c [2021-11-17 00:54:38,250 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90abbed62/465397b40552461dbaf0ef6f4bdcd705 [2021-11-17 00:54:38,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-17 00:54:38,253 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-17 00:54:38,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-17 00:54:38,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-17 00:54:38,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-17 00:54:38,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:54:38" (1/1) ... [2021-11-17 00:54:38,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a366875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:54:38, skipping insertion in model container [2021-11-17 00:54:38,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:54:38" (1/1) ... [2021-11-17 00:54:38,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-17 00:54:38,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-17 00:54:38,823 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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2021-11-17 00:54:39,022 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 00:54:39,046 INFO L203 MainTranslator]: Completed pre-run [2021-11-17 00:54:39,152 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-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2021-11-17 00:54:39,222 INFO L207 PostProcessor]: Analyzing one entry point: main [2021-11-17 00:54:39,251 INFO L208 MainTranslator]: Completed translation [2021-11-17 00:54:39,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:54:39 WrapperNode [2021-11-17 00:54:39,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-17 00:54:39,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-17 00:54:39,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-17 00:54:39,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-17 00:54:39,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:54:39" (1/1) ... [2021-11-17 00:54:39,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:54:39" (1/1) ... [2021-11-17 00:54:39,385 INFO L137 Inliner]: procedures = 116, calls = 313, calls flagged for inlining = 35, calls inlined = 32, statements flattened = 937 [2021-11-17 00:54:39,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-17 00:54:39,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-17 00:54:39,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-17 00:54:39,386 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-17 00:54:39,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:54:39" (1/1) ... [2021-11-17 00:54:39,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:54:39" (1/1) ... [2021-11-17 00:54:39,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:54:39" (1/1) ... [2021-11-17 00:54:39,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:54:39" (1/1) ... [2021-11-17 00:54:39,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:54:39" (1/1) ... [2021-11-17 00:54:39,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:54:39" (1/1) ... [2021-11-17 00:54:39,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:54:39" (1/1) ... [2021-11-17 00:54:39,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-17 00:54:39,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-17 00:54:39,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-17 00:54:39,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-17 00:54:39,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:54:39" (1/1) ... [2021-11-17 00:54:39,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-17 00:54:39,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:54:39,528 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) [2021-11-17 00:54:39,534 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 [2021-11-17 00:54:39,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-17 00:54:39,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-17 00:54:39,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-17 00:54:39,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-17 00:54:39,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-17 00:54:39,555 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2021-11-17 00:54:39,555 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2021-11-17 00:54:39,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-11-17 00:54:39,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-11-17 00:54:39,555 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_tx_fixup [2021-11-17 00:54:39,555 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_tx_fixup [2021-11-17 00:54:39,556 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2021-11-17 00:54:39,556 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2021-11-17 00:54:39,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-11-17 00:54:39,556 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-11-17 00:54:39,556 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2021-11-17 00:54:39,556 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2021-11-17 00:54:39,556 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-17 00:54:39,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-17 00:54:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_rx_fixup [2021-11-17 00:54:39,557 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_rx_fixup [2021-11-17 00:54:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_12 [2021-11-17 00:54:39,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_12 [2021-11-17 00:54:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2021-11-17 00:54:39,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2021-11-17 00:54:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-17 00:54:39,558 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-17 00:54:39,558 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2021-11-17 00:54:39,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2021-11-17 00:54:39,558 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2021-11-17 00:54:39,558 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2021-11-17 00:54:39,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-17 00:54:39,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-17 00:54:39,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-17 00:54:39,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-17 00:54:39,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-11-17 00:54:39,559 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-11-17 00:54:39,560 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_skb_return [2021-11-17 00:54:39,560 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_skb_return [2021-11-17 00:54:39,560 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-11-17 00:54:39,560 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-11-17 00:54:39,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-17 00:54:39,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-17 00:54:39,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-17 00:54:39,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-17 00:54:39,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-17 00:54:39,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-17 00:54:39,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-17 00:54:39,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-17 00:54:39,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-17 00:54:39,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-17 00:54:39,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-17 00:54:39,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-17 00:54:39,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-17 00:54:39,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-17 00:54:39,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-17 00:54:39,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-17 00:54:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-17 00:54:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2021-11-17 00:54:39,564 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2021-11-17 00:54:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-11-17 00:54:39,564 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-11-17 00:54:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_cmd [2021-11-17 00:54:39,564 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_cmd [2021-11-17 00:54:39,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-17 00:54:39,565 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-11-17 00:54:39,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-11-17 00:54:39,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-17 00:54:39,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-17 00:54:39,827 INFO L236 CfgBuilder]: Building ICFG [2021-11-17 00:54:39,828 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-17 00:54:39,979 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-11-17 00:54:43,648 INFO L277 CfgBuilder]: Performing block encoding [2021-11-17 00:54:43,668 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-17 00:54:43,671 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-17 00:54:43,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:54:43 BoogieIcfgContainer [2021-11-17 00:54:43,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-17 00:54:43,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-17 00:54:43,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-17 00:54:43,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-17 00:54:43,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:54:38" (1/3) ... [2021-11-17 00:54:43,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304ad35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:54:43, skipping insertion in model container [2021-11-17 00:54:43,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:54:39" (2/3) ... [2021-11-17 00:54:43,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@304ad35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:54:43, skipping insertion in model container [2021-11-17 00:54:43,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:54:43" (3/3) ... [2021-11-17 00:54:43,681 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2021-11-17 00:54:43,684 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-17 00:54:43,685 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-17 00:54:43,740 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-17 00:54:43,746 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-17 00:54:43,746 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-17 00:54:43,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 301 states, 225 states have (on average 1.3911111111111112) internal successors, (313), 231 states have internal predecessors, (313), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2021-11-17 00:54:43,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-17 00:54:43,771 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:54:43,771 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:54:43,772 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:54:43,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:54:43,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1543576195, now seen corresponding path program 1 times [2021-11-17 00:54:43,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:54:43,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542909748] [2021-11-17 00:54:43,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:54:43,787 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:54:43,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:54:43,788 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:54:43,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-17 00:54:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:54:44,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-17 00:54:44,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:54:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-17 00:54:44,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:54:44,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-17 00:54:44,676 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:54:44,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542909748] [2021-11-17 00:54:44,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542909748] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-17 00:54:44,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-17 00:54:44,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-11-17 00:54:44,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704937347] [2021-11-17 00:54:44,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-17 00:54:44,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:54:44,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:54:44,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:54:44,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-17 00:54:44,708 INFO L87 Difference]: Start difference. First operand has 301 states, 225 states have (on average 1.3911111111111112) internal successors, (313), 231 states have internal predecessors, (313), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-17 00:54:44,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:54:44,866 INFO L93 Difference]: Finished difference Result 600 states and 867 transitions. [2021-11-17 00:54:44,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 00:54:44,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2021-11-17 00:54:44,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:54:44,880 INFO L225 Difference]: With dead ends: 600 [2021-11-17 00:54:44,880 INFO L226 Difference]: Without dead ends: 291 [2021-11-17 00:54:44,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:54:44,887 INFO L933 BasicCegarLoop]: 411 mSDtfsCounter, 2 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 00:54:44,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1230 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 00:54:44,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-11-17 00:54:44,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2021-11-17 00:54:44,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 221 states have (on average 1.3574660633484164) internal successors, (300), 221 states have internal predecessors, (300), 51 states have call successors, (51), 19 states have call predecessors, (51), 18 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-17 00:54:44,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 401 transitions. [2021-11-17 00:54:44,931 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 401 transitions. Word has length 36 [2021-11-17 00:54:44,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:54:44,932 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 401 transitions. [2021-11-17 00:54:44,932 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-17 00:54:44,932 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 401 transitions. [2021-11-17 00:54:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-11-17 00:54:44,934 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:54:44,934 INFO L514 BasicCegarLoop]: 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] [2021-11-17 00:54:44,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-17 00:54:45,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:54:45,144 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:54:45,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:54:45,144 INFO L85 PathProgramCache]: Analyzing trace with hash -141756985, now seen corresponding path program 1 times [2021-11-17 00:54:45,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:54:45,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026845659] [2021-11-17 00:54:45,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:54:45,145 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:54:45,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:54:45,148 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:54:45,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-17 00:54:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:54:45,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 00:54:45,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:54:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-17 00:54:45,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:54:45,956 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-17 00:54:45,956 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:54:45,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026845659] [2021-11-17 00:54:45,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026845659] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-17 00:54:45,957 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-17 00:54:45,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-17 00:54:45,957 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299818293] [2021-11-17 00:54:45,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-17 00:54:45,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-17 00:54:45,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:54:45,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-17 00:54:45,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-17 00:54:45,959 INFO L87 Difference]: Start difference. First operand 291 states and 401 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-17 00:54:46,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:54:46,266 INFO L93 Difference]: Finished difference Result 582 states and 805 transitions. [2021-11-17 00:54:46,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-17 00:54:46,267 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2021-11-17 00:54:46,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:54:46,274 INFO L225 Difference]: With dead ends: 582 [2021-11-17 00:54:46,275 INFO L226 Difference]: Without dead ends: 294 [2021-11-17 00:54:46,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-11-17 00:54:46,280 INFO L933 BasicCegarLoop]: 398 mSDtfsCounter, 9 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 00:54:46,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 1983 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 00:54:46,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-11-17 00:54:46,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2021-11-17 00:54:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 224 states have (on average 1.3526785714285714) internal successors, (303), 224 states have internal predecessors, (303), 51 states have call successors, (51), 19 states have call predecessors, (51), 18 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2021-11-17 00:54:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 404 transitions. [2021-11-17 00:54:46,308 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 404 transitions. Word has length 38 [2021-11-17 00:54:46,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:54:46,308 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 404 transitions. [2021-11-17 00:54:46,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-17 00:54:46,309 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 404 transitions. [2021-11-17 00:54:46,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-17 00:54:46,315 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:54:46,315 INFO L514 BasicCegarLoop]: trace histogram [8, 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] [2021-11-17 00:54:46,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-17 00:54:46,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:54:46,526 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:54:46,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:54:46,527 INFO L85 PathProgramCache]: Analyzing trace with hash 385357699, now seen corresponding path program 2 times [2021-11-17 00:54:46,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:54:46,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841517529] [2021-11-17 00:54:46,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-17 00:54:46,528 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:54:46,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:54:46,529 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:54:46,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-17 00:54:46,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-17 00:54:46,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-17 00:54:46,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 00:54:46,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:54:46,899 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-11-17 00:54:46,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:54:47,048 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-11-17 00:54:47,048 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:54:47,048 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841517529] [2021-11-17 00:54:47,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841517529] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:54:47,049 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:54:47,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-17 00:54:47,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003001559] [2021-11-17 00:54:47,049 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:54:47,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-17 00:54:47,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:54:47,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-17 00:54:47,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:54:47,050 INFO L87 Difference]: Start difference. First operand 294 states and 404 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-17 00:54:49,084 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:54:49,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:54:49,763 INFO L93 Difference]: Finished difference Result 1075 states and 1497 transitions. [2021-11-17 00:54:49,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-17 00:54:49,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2021-11-17 00:54:49,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:54:49,768 INFO L225 Difference]: With dead ends: 1075 [2021-11-17 00:54:49,768 INFO L226 Difference]: Without dead ends: 799 [2021-11-17 00:54:49,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-17 00:54:49,770 INFO L933 BasicCegarLoop]: 493 mSDtfsCounter, 721 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-11-17 00:54:49,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [721 Valid, 1480 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 115 Invalid, 1 Unknown, 0 Unchecked, 2.6s Time] [2021-11-17 00:54:49,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2021-11-17 00:54:49,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2021-11-17 00:54:49,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 609 states have (on average 1.374384236453202) internal successors, (837), 609 states have internal predecessors, (837), 137 states have call successors, (137), 53 states have call predecessors, (137), 52 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2021-11-17 00:54:49,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1110 transitions. [2021-11-17 00:54:49,807 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1110 transitions. Word has length 44 [2021-11-17 00:54:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:54:49,807 INFO L470 AbstractCegarLoop]: Abstraction has 799 states and 1110 transitions. [2021-11-17 00:54:49,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-17 00:54:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1110 transitions. [2021-11-17 00:54:49,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-17 00:54:49,808 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:54:49,809 INFO L514 BasicCegarLoop]: trace histogram [8, 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] [2021-11-17 00:54:49,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-17 00:54:50,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:54:50,010 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:54:50,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:54:50,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1436796545, now seen corresponding path program 1 times [2021-11-17 00:54:50,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:54:50,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479273869] [2021-11-17 00:54:50,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:54:50,011 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:54:50,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:54:50,016 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:54:50,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-17 00:54:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:54:50,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-17 00:54:50,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:54:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-11-17 00:54:50,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:54:51,074 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-17 00:54:51,074 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:54:51,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479273869] [2021-11-17 00:54:51,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479273869] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:54:51,074 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:54:51,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2021-11-17 00:54:51,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945156030] [2021-11-17 00:54:51,075 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:54:51,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-17 00:54:51,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:54:51,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-17 00:54:51,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-17 00:54:51,076 INFO L87 Difference]: Start difference. First operand 799 states and 1110 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-17 00:54:51,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:54:51,393 INFO L93 Difference]: Finished difference Result 2358 states and 3316 transitions. [2021-11-17 00:54:51,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 00:54:51,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2021-11-17 00:54:51,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:54:51,406 INFO L225 Difference]: With dead ends: 2358 [2021-11-17 00:54:51,406 INFO L226 Difference]: Without dead ends: 1571 [2021-11-17 00:54:51,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-17 00:54:51,411 INFO L933 BasicCegarLoop]: 462 mSDtfsCounter, 363 mSDsluCounter, 2229 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 2691 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:54:51,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 2691 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-17 00:54:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2021-11-17 00:54:51,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1571. [2021-11-17 00:54:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1197 states have (on average 1.3751044277360067) internal successors, (1646), 1197 states have internal predecessors, (1646), 270 states have call successors, (270), 104 states have call predecessors, (270), 103 states have return successors, (284), 269 states have call predecessors, (284), 269 states have call successors, (284) [2021-11-17 00:54:51,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2200 transitions. [2021-11-17 00:54:51,502 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2200 transitions. Word has length 54 [2021-11-17 00:54:51,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:54:51,503 INFO L470 AbstractCegarLoop]: Abstraction has 1571 states and 2200 transitions. [2021-11-17 00:54:51,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-17 00:54:51,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2200 transitions. [2021-11-17 00:54:51,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-17 00:54:51,506 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:54:51,506 INFO L514 BasicCegarLoop]: trace histogram [8, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:54:51,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-17 00:54:51,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:54:51,719 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:54:51,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:54:51,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1814811339, now seen corresponding path program 1 times [2021-11-17 00:54:51,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:54:51,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591842482] [2021-11-17 00:54:51,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:54:51,721 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:54:51,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:54:51,731 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:54:51,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-17 00:54:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:54:52,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 00:54:52,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:54:52,452 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-11-17 00:54:52,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:54:52,701 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-11-17 00:54:52,701 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:54:52,702 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591842482] [2021-11-17 00:54:52,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591842482] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:54:52,702 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:54:52,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-17 00:54:52,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329400099] [2021-11-17 00:54:52,702 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:54:52,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 00:54:52,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:54:52,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 00:54:52,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 00:54:52,703 INFO L87 Difference]: Start difference. First operand 1571 states and 2200 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 00:54:52,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:54:52,891 INFO L93 Difference]: Finished difference Result 3440 states and 4846 transitions. [2021-11-17 00:54:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 00:54:52,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 92 [2021-11-17 00:54:52,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:54:52,899 INFO L225 Difference]: With dead ends: 3440 [2021-11-17 00:54:52,899 INFO L226 Difference]: Without dead ends: 1887 [2021-11-17 00:54:52,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 00:54:52,904 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 108 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-17 00:54:52,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 777 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-17 00:54:52,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2021-11-17 00:54:52,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1835. [2021-11-17 00:54:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1435 states have (on average 1.395121951219512) internal successors, (2002), 1435 states have internal predecessors, (2002), 285 states have call successors, (285), 115 states have call predecessors, (285), 114 states have return successors, (299), 284 states have call predecessors, (299), 284 states have call successors, (299) [2021-11-17 00:54:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2586 transitions. [2021-11-17 00:54:52,997 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2586 transitions. Word has length 92 [2021-11-17 00:54:52,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:54:52,997 INFO L470 AbstractCegarLoop]: Abstraction has 1835 states and 2586 transitions. [2021-11-17 00:54:52,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 00:54:52,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2586 transitions. [2021-11-17 00:54:53,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-17 00:54:53,001 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:54:53,001 INFO L514 BasicCegarLoop]: trace histogram [8, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:54:53,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-11-17 00:54:53,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:54:53,216 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:54:53,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:54:53,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1475185418, now seen corresponding path program 1 times [2021-11-17 00:54:53,217 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:54:53,217 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128233302] [2021-11-17 00:54:53,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:54:53,217 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:54:53,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:54:53,218 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:54:53,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-17 00:54:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:54:53,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 00:54:53,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:54:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2021-11-17 00:54:54,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:54:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2021-11-17 00:54:54,387 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:54:54,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128233302] [2021-11-17 00:54:54,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128233302] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:54:54,388 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:54:54,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-17 00:54:54,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988761006] [2021-11-17 00:54:54,388 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:54:54,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 00:54:54,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:54:54,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 00:54:54,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 00:54:54,389 INFO L87 Difference]: Start difference. First operand 1835 states and 2586 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-17 00:54:56,427 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-17 00:54:56,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:54:56,628 INFO L93 Difference]: Finished difference Result 4686 states and 6582 transitions. [2021-11-17 00:54:56,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 00:54:56,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 120 [2021-11-17 00:54:56,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:54:56,641 INFO L225 Difference]: With dead ends: 4686 [2021-11-17 00:54:56,642 INFO L226 Difference]: Without dead ends: 2880 [2021-11-17 00:54:56,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 00:54:56,649 INFO L933 BasicCegarLoop]: 506 mSDtfsCounter, 342 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:54:56,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 768 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-11-17 00:54:56,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2021-11-17 00:54:56,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2871. [2021-11-17 00:54:56,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 2247 states have (on average 1.376502002670227) internal successors, (3093), 2247 states have internal predecessors, (3093), 431 states have call successors, (431), 193 states have call predecessors, (431), 192 states have return successors, (454), 430 states have call predecessors, (454), 430 states have call successors, (454) [2021-11-17 00:54:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 3978 transitions. [2021-11-17 00:54:56,770 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 3978 transitions. Word has length 120 [2021-11-17 00:54:56,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:54:56,771 INFO L470 AbstractCegarLoop]: Abstraction has 2871 states and 3978 transitions. [2021-11-17 00:54:56,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2021-11-17 00:54:56,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 3978 transitions. [2021-11-17 00:54:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-11-17 00:54:56,777 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:54:56,778 INFO L514 BasicCegarLoop]: trace histogram [8, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:54:56,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-17 00:54:56,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:54:56,991 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:54:56,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:54:56,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1817096524, now seen corresponding path program 1 times [2021-11-17 00:54:56,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:54:56,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934338233] [2021-11-17 00:54:56,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:54:56,993 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:54:56,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:54:56,994 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:54:56,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-17 00:54:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:54:57,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-17 00:54:57,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:54:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-11-17 00:54:57,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:54:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-11-17 00:54:58,646 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:54:58,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934338233] [2021-11-17 00:54:58,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934338233] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:54:58,646 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:54:58,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-11-17 00:54:58,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618718334] [2021-11-17 00:54:58,646 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:54:58,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-17 00:54:58,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:54:58,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-17 00:54:58,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:54:58,647 INFO L87 Difference]: Start difference. First operand 2871 states and 3978 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-17 00:54:58,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:54:58,754 INFO L93 Difference]: Finished difference Result 5791 states and 8096 transitions. [2021-11-17 00:54:58,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-17 00:54:58,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) Word has length 120 [2021-11-17 00:54:58,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:54:58,769 INFO L225 Difference]: With dead ends: 5791 [2021-11-17 00:54:58,769 INFO L226 Difference]: Without dead ends: 2949 [2021-11-17 00:54:58,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-17 00:54:58,822 INFO L933 BasicCegarLoop]: 398 mSDtfsCounter, 2 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 00:54:58,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1587 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 00:54:58,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2021-11-17 00:54:58,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 2931. [2021-11-17 00:54:58,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2931 states, 2289 states have (on average 1.3695937090432504) internal successors, (3135), 2295 states have internal predecessors, (3135), 431 states have call successors, (431), 193 states have call predecessors, (431), 210 states have return successors, (482), 442 states have call predecessors, (482), 430 states have call successors, (482) [2021-11-17 00:54:58,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2931 states to 2931 states and 4048 transitions. [2021-11-17 00:54:58,897 INFO L78 Accepts]: Start accepts. Automaton has 2931 states and 4048 transitions. Word has length 120 [2021-11-17 00:54:58,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:54:58,897 INFO L470 AbstractCegarLoop]: Abstraction has 2931 states and 4048 transitions. [2021-11-17 00:54:58,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) [2021-11-17 00:54:58,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2931 states and 4048 transitions. [2021-11-17 00:54:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-11-17 00:54:58,901 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:54:58,901 INFO L514 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:54:58,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-17 00:54:59,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:54:59,117 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:54:59,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:54:59,119 INFO L85 PathProgramCache]: Analyzing trace with hash -583958502, now seen corresponding path program 1 times [2021-11-17 00:54:59,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:54:59,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066054793] [2021-11-17 00:54:59,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:54:59,120 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:54:59,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:54:59,121 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:54:59,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-17 00:54:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:54:59,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-17 00:54:59,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:54:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-11-17 00:54:59,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:55:00,112 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-11-17 00:55:00,112 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:55:00,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066054793] [2021-11-17 00:55:00,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066054793] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:55:00,112 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:55:00,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-17 00:55:00,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077138453] [2021-11-17 00:55:00,112 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:55:00,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-17 00:55:00,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:55:00,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-17 00:55:00,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 00:55:00,113 INFO L87 Difference]: Start difference. First operand 2931 states and 4048 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 00:55:00,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:55:00,203 INFO L93 Difference]: Finished difference Result 5845 states and 8106 transitions. [2021-11-17 00:55:00,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-17 00:55:00,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2021-11-17 00:55:00,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:55:00,213 INFO L225 Difference]: With dead ends: 5845 [2021-11-17 00:55:00,213 INFO L226 Difference]: Without dead ends: 2943 [2021-11-17 00:55:00,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-17 00:55:00,220 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 0 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-17 00:55:00,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 794 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-17 00:55:00,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2021-11-17 00:55:00,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2943. [2021-11-17 00:55:00,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2943 states, 2301 states have (on average 1.3676662320730117) internal successors, (3147), 2307 states have internal predecessors, (3147), 431 states have call successors, (431), 193 states have call predecessors, (431), 210 states have return successors, (482), 442 states have call predecessors, (482), 430 states have call successors, (482) [2021-11-17 00:55:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2943 states to 2943 states and 4060 transitions. [2021-11-17 00:55:00,293 INFO L78 Accepts]: Start accepts. Automaton has 2943 states and 4060 transitions. Word has length 145 [2021-11-17 00:55:00,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:55:00,294 INFO L470 AbstractCegarLoop]: Abstraction has 2943 states and 4060 transitions. [2021-11-17 00:55:00,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2021-11-17 00:55:00,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2943 states and 4060 transitions. [2021-11-17 00:55:00,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-11-17 00:55:00,298 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:55:00,299 INFO L514 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:55:00,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-11-17 00:55:00,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:55:00,513 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:55:00,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:55:00,514 INFO L85 PathProgramCache]: Analyzing trace with hash -140057828, now seen corresponding path program 1 times [2021-11-17 00:55:00,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:55:00,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390209138] [2021-11-17 00:55:00,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:55:00,515 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:55:00,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:55:00,516 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:55:00,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-17 00:55:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:00,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-17 00:55:00,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:55:01,574 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-11-17 00:55:01,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:55:03,188 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-11-17 00:55:03,188 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:55:03,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390209138] [2021-11-17 00:55:03,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390209138] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:55:03,188 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:55:03,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 10 [2021-11-17 00:55:03,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733895850] [2021-11-17 00:55:03,188 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:55:03,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-17 00:55:03,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:55:03,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-17 00:55:03,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-11-17 00:55:03,189 INFO L87 Difference]: Start difference. First operand 2943 states and 4060 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 00:55:03,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:55:03,764 INFO L93 Difference]: Finished difference Result 5959 states and 8292 transitions. [2021-11-17 00:55:03,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-17 00:55:03,766 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 2 states have call successors, (14) Word has length 145 [2021-11-17 00:55:03,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:55:03,777 INFO L225 Difference]: With dead ends: 5959 [2021-11-17 00:55:03,778 INFO L226 Difference]: Without dead ends: 3045 [2021-11-17 00:55:03,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-17 00:55:03,787 INFO L933 BasicCegarLoop]: 409 mSDtfsCounter, 16 mSDsluCounter, 3239 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3648 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-17 00:55:03,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 3648 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-17 00:55:03,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3045 states. [2021-11-17 00:55:03,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3045 to 3009. [2021-11-17 00:55:03,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3009 states, 2349 states have (on average 1.355044699872286) internal successors, (3183), 2355 states have internal predecessors, (3183), 437 states have call successors, (437), 193 states have call predecessors, (437), 222 states have return successors, (506), 460 states have call predecessors, (506), 436 states have call successors, (506) [2021-11-17 00:55:03,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3009 states to 3009 states and 4126 transitions. [2021-11-17 00:55:03,861 INFO L78 Accepts]: Start accepts. Automaton has 3009 states and 4126 transitions. Word has length 145 [2021-11-17 00:55:03,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:55:03,862 INFO L470 AbstractCegarLoop]: Abstraction has 3009 states and 4126 transitions. [2021-11-17 00:55:03,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-17 00:55:03,862 INFO L276 IsEmpty]: Start isEmpty. Operand 3009 states and 4126 transitions. [2021-11-17 00:55:03,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-11-17 00:55:03,866 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:55:03,866 INFO L514 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:55:03,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-17 00:55:04,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:55:04,080 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:55:04,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:55:04,081 INFO L85 PathProgramCache]: Analyzing trace with hash 921632664, now seen corresponding path program 1 times [2021-11-17 00:55:04,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:55:04,081 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827461870] [2021-11-17 00:55:04,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:55:04,081 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:55:04,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:55:04,082 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:55:04,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-17 00:55:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:04,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-17 00:55:04,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:55:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-11-17 00:55:05,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:55:09,203 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-11-17 00:55:09,203 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:55:09,203 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827461870] [2021-11-17 00:55:09,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827461870] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:55:09,203 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:55:09,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 14] imperfect sequences [] total 15 [2021-11-17 00:55:09,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764041814] [2021-11-17 00:55:09,203 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:55:09,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-17 00:55:09,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:55:09,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-17 00:55:09,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-11-17 00:55:09,204 INFO L87 Difference]: Start difference. First operand 3009 states and 4126 transitions. Second operand has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 11 states have internal predecessors, (83), 3 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 00:55:10,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:55:10,780 INFO L93 Difference]: Finished difference Result 6289 states and 8694 transitions. [2021-11-17 00:55:10,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-17 00:55:10,781 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 11 states have internal predecessors, (83), 3 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 2 states have call successors, (13) Word has length 133 [2021-11-17 00:55:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:55:10,793 INFO L225 Difference]: With dead ends: 6289 [2021-11-17 00:55:10,793 INFO L226 Difference]: Without dead ends: 3309 [2021-11-17 00:55:10,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-11-17 00:55:10,800 INFO L933 BasicCegarLoop]: 434 mSDtfsCounter, 41 mSDsluCounter, 5119 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 5553 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-11-17 00:55:10,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 5553 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-11-17 00:55:10,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3309 states. [2021-11-17 00:55:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3309 to 3063. [2021-11-17 00:55:10,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3063 states, 2391 states have (on average 1.3488080301129235) internal successors, (3225), 2391 states have internal predecessors, (3225), 443 states have call successors, (443), 193 states have call predecessors, (443), 228 states have return successors, (524), 478 states have call predecessors, (524), 442 states have call successors, (524) [2021-11-17 00:55:10,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 4192 transitions. [2021-11-17 00:55:10,912 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 4192 transitions. Word has length 133 [2021-11-17 00:55:10,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:55:10,913 INFO L470 AbstractCegarLoop]: Abstraction has 3063 states and 4192 transitions. [2021-11-17 00:55:10,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 11 states have internal predecessors, (83), 3 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (13), 7 states have call predecessors, (13), 2 states have call successors, (13) [2021-11-17 00:55:10,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 4192 transitions. [2021-11-17 00:55:10,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-11-17 00:55:10,919 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:55:10,919 INFO L514 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:55:10,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-11-17 00:55:11,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:55:11,135 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:55:11,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:55:11,136 INFO L85 PathProgramCache]: Analyzing trace with hash -660711512, now seen corresponding path program 1 times [2021-11-17 00:55:11,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:55:11,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26535342] [2021-11-17 00:55:11,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:55:11,137 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:55:11,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:55:11,138 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:55:11,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-17 00:55:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:11,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-17 00:55:11,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:55:12,881 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-11-17 00:55:12,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-17 00:55:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2021-11-17 00:55:16,349 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:55:16,349 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26535342] [2021-11-17 00:55:16,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26535342] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-17 00:55:16,349 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:55:16,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 14] imperfect sequences [] total 15 [2021-11-17 00:55:16,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56320203] [2021-11-17 00:55:16,349 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-17 00:55:16,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-17 00:55:16,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-17 00:55:16,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-17 00:55:16,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2021-11-17 00:55:16,350 INFO L87 Difference]: Start difference. First operand 3063 states and 4192 transitions. Second operand has 15 states, 15 states have (on average 6.266666666666667) internal successors, (94), 11 states have internal predecessors, (94), 3 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 00:55:18,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-17 00:55:18,111 INFO L93 Difference]: Finished difference Result 6379 states and 8796 transitions. [2021-11-17 00:55:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-17 00:55:18,112 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.266666666666667) internal successors, (94), 11 states have internal predecessors, (94), 3 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 2 states have call successors, (15) Word has length 151 [2021-11-17 00:55:18,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-17 00:55:18,124 INFO L225 Difference]: With dead ends: 6379 [2021-11-17 00:55:18,124 INFO L226 Difference]: Without dead ends: 3345 [2021-11-17 00:55:18,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2021-11-17 00:55:18,131 INFO L933 BasicCegarLoop]: 434 mSDtfsCounter, 43 mSDsluCounter, 5117 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 5551 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-17 00:55:18,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 5551 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-11-17 00:55:18,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3345 states. [2021-11-17 00:55:18,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3345 to 3087. [2021-11-17 00:55:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3087 states, 2415 states have (on average 1.3453416149068322) internal successors, (3249), 2403 states have internal predecessors, (3249), 443 states have call successors, (443), 193 states have call predecessors, (443), 228 states have return successors, (524), 490 states have call predecessors, (524), 442 states have call successors, (524) [2021-11-17 00:55:18,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 3087 states and 4216 transitions. [2021-11-17 00:55:18,266 INFO L78 Accepts]: Start accepts. Automaton has 3087 states and 4216 transitions. Word has length 151 [2021-11-17 00:55:18,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-17 00:55:18,266 INFO L470 AbstractCegarLoop]: Abstraction has 3087 states and 4216 transitions. [2021-11-17 00:55:18,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.266666666666667) internal successors, (94), 11 states have internal predecessors, (94), 3 states have call successors, (16), 2 states have call predecessors, (16), 6 states have return successors, (15), 7 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-17 00:55:18,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3087 states and 4216 transitions. [2021-11-17 00:55:18,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2021-11-17 00:55:18,271 INFO L506 BasicCegarLoop]: Found error trace [2021-11-17 00:55:18,271 INFO L514 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:55:18,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-11-17 00:55:18,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-11-17 00:55:18,490 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-17 00:55:18,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-17 00:55:18,490 INFO L85 PathProgramCache]: Analyzing trace with hash -796082131, now seen corresponding path program 1 times [2021-11-17 00:55:18,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-17 00:55:18,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1689806611] [2021-11-17 00:55:18,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:55:18,491 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-17 00:55:18,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-17 00:55:18,492 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-17 00:55:18,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-11-17 00:55:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:55:19,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 53 conjunts are in the unsatisfiable core [2021-11-17 00:55:19,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-17 00:55:19,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-17 00:55:47,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-11-17 00:56:42,485 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-17 00:56:42,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1689806611] [2021-11-17 00:56:42,486 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Index 1 out of bounds for length 1 [2021-11-17 00:56:42,486 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1048263580] [2021-11-17 00:56:42,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:56:42,486 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-17 00:56:42,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-11-17 00:56:42,488 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-17 00:56:42,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2021-11-17 00:56:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:56:43,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 59 conjunts are in the unsatisfiable core [2021-11-17 00:56:43,320 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@53f9d0c3 [2021-11-17 00:56:43,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684592642] [2021-11-17 00:56:43,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-17 00:56:43,321 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:56:43,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-17 00:56:43,354 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-17 00:56:43,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-17 00:56:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-17 00:56:43,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 42 conjunts are in the unsatisfiable core [2021-11-17 00:56:43,732 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@53f9d0c3 [2021-11-17 00:56:43,732 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-17 00:56:43,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-17 00:56:43,732 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-11-17 00:56:43,733 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-17 00:56:43,737 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-17 00:56:43,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2021-11-17 00:56:43,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-11-17 00:56:44,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-17 00:56:44,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-17 00:56:44,342 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-17 00:56:44,344 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-17 00:56:44,350 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2021-11-17 00:56:44,350 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2021-11-17 00:56:44,352 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == dest.base && #res.offset == dest.offset; is not ensure(true) [2021-11-17 00:56:44,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:56:44 BoogieIcfgContainer [2021-11-17 00:56:44,389 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-17 00:56:44,399 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-17 00:56:44,399 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-17 00:56:44,399 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-17 00:56:44,399 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:54:43" (3/4) ... [2021-11-17 00:56:44,401 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-17 00:56:44,402 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-17 00:56:44,402 INFO L158 Benchmark]: Toolchain (without parser) took 126149.03ms. Allocated memory was 48.2MB in the beginning and 325.1MB in the end (delta: 276.8MB). Free memory was 26.5MB in the beginning and 112.8MB in the end (delta: -86.3MB). Peak memory consumption was 191.3MB. Max. memory is 16.1GB. [2021-11-17 00:56:44,402 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 48.2MB. Free memory was 29.9MB in the beginning and 29.8MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-17 00:56:44,402 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1005.99ms. Allocated memory was 48.2MB in the beginning and 77.6MB in the end (delta: 29.4MB). Free memory was 26.3MB in the beginning and 33.2MB in the end (delta: -6.9MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2021-11-17 00:56:44,403 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.46ms. Allocated memory is still 77.6MB. Free memory was 33.2MB in the beginning and 26.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-17 00:56:44,403 INFO L158 Benchmark]: Boogie Preprocessor took 119.87ms. Allocated memory was 77.6MB in the beginning and 111.1MB in the end (delta: 33.6MB). Free memory was 26.9MB in the beginning and 62.3MB in the end (delta: -35.4MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2021-11-17 00:56:44,404 INFO L158 Benchmark]: RCFGBuilder took 4167.70ms. Allocated memory was 111.1MB in the beginning and 224.4MB in the end (delta: 113.2MB). Free memory was 62.3MB in the beginning and 81.1MB in the end (delta: -18.8MB). Peak memory consumption was 100.4MB. Max. memory is 16.1GB. [2021-11-17 00:56:44,405 INFO L158 Benchmark]: TraceAbstraction took 120713.18ms. Allocated memory was 224.4MB in the beginning and 325.1MB in the end (delta: 100.7MB). Free memory was 81.1MB in the beginning and 112.8MB in the end (delta: -31.7MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. [2021-11-17 00:56:44,405 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 325.1MB. Free memory is still 112.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-17 00:56:44,406 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.14ms. Allocated memory is still 48.2MB. Free memory was 29.9MB in the beginning and 29.8MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1005.99ms. Allocated memory was 48.2MB in the beginning and 77.6MB in the end (delta: 29.4MB). Free memory was 26.3MB in the beginning and 33.2MB in the end (delta: -6.9MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.46ms. Allocated memory is still 77.6MB. Free memory was 33.2MB in the beginning and 26.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.87ms. Allocated memory was 77.6MB in the beginning and 111.1MB in the end (delta: 33.6MB). Free memory was 26.9MB in the beginning and 62.3MB in the end (delta: -35.4MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * RCFGBuilder took 4167.70ms. Allocated memory was 111.1MB in the beginning and 224.4MB in the end (delta: 113.2MB). Free memory was 62.3MB in the beginning and 81.1MB in the end (delta: -18.8MB). Peak memory consumption was 100.4MB. Max. memory is 16.1GB. * TraceAbstraction took 120713.18ms. Allocated memory was 224.4MB in the beginning and 325.1MB in the end (delta: 100.7MB). Free memory was 81.1MB in the beginning and 112.8MB in the end (delta: -31.7MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 325.1MB. Free memory is still 112.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == dest.base && #res.offset == dest.offset; is not ensure(true) * 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: 5569]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint, overapproximation of large string literal at line 5927. Possible FailurePath: [L5592] struct sk_buff *cx82310_info_group2 ; [L5593] int LDV_IN_INTERRUPT = 1; [L5594] int ldv_state_variable_2 ; [L5595] int ref_cnt ; [L5596] struct usbnet *cx82310_info_group0 ; [L5597] int ldv_state_variable_1 ; [L5598] int usb_counter ; [L5599] struct usb_interface *cx82310_info_group1 ; [L5600] struct usb_interface *cx82310_driver_group1 ; [L5601] int ldv_state_variable_0 ; [L5907-L5909] static struct driver_info const cx82310_info = {(char *)"Conexant CX82310 USB ethernet", 32, & cx82310_bind, & cx82310_unbind, 0, 0, 0, 0, 0, 0, & cx82310_rx_fixup, & cx82310_tx_fixup, 0, 0, 0, 0, 0UL}; [L5910-L5911] static struct usb_device_id const products[2U] = { {899U, 1394U, 51969U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 255U, 0U, 0U, (unsigned char)0, (unsigned long )(& cx82310_info)}}; [L5912] struct usb_device_id const __mod_usb__products_device_table ; [L5913-L5922] static struct usb_driver cx82310_driver = {"cx82310_eth", & usbnet_probe, & usbnet_disconnect, 0, & usbnet_suspend, & usbnet_resume, 0, 0, 0, (struct usb_device_id const *)(& products), {{{{{{0U}}, 0U, 0U, 0, {0, {0, 0}, 0, 0, 0UL}}}}, {0, 0}}, {{0, 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}, (unsigned char)0, (unsigned char)0, 1U, (unsigned char)0}; [L5939] int ldv_retval_2 ; [L5940] int ldv_retval_0 ; [L5941] int ldv_retval_5 ; [L5942] int ldv_retval_4 ; [L5944] int ldv_retval_1 ; [L5946] int ldv_retval_3 ; [L6231] Element set_impl[15] ; [L6232] int last_index = 0; [L6366] Set LDV_SKBS ; [L5973] struct usb_device_id *ldvarg1 ; [L5974] void *tmp ; [L5975] pm_message_t ldvarg0 ; [L5976] gfp_t ldvarg2 ; [L5977] int tmp___0 ; [L5978] int tmp___1 ; [L5979] int tmp___2 ; [L5980] int tmp___3 ; [L5982] CALL, EXPR ldv_zalloc(32UL) [L5534] void *p ; [L5535] void *tmp ; [L5536] int tmp___0 ; [L5538] tmp___0 = __VERIFIER_nondet_int() [L5539] COND TRUE tmp___0 != 0 [L5540] return ((void *)0); [L5982] RET, EXPR ldv_zalloc(32UL) [L5982] tmp = ldv_zalloc(32UL) [L5983] ldvarg1 = (struct usb_device_id *)tmp [L5984] CALL ldv_initialize() [L6385] CALL ldv_set_init(LDV_SKBS) [L6237] set = set_impl [L6238] last_index = 0 [L6385] RET ldv_set_init(LDV_SKBS) [L5984] RET ldv_initialize() [L5985] FCALL memset((void *)(& ldvarg0), 0, 4UL) [L5986] FCALL memset((void *)(& ldvarg2), 0, 4UL) [L5987] ldv_state_variable_1 = 0 [L5988] ref_cnt = 0 [L5989] ldv_state_variable_0 = 1 [L5990] ldv_state_variable_2 = 0 [L5992] tmp___0 = __VERIFIER_nondet_int() [L5994] case 0: [L6060] case 1: [L6061] COND TRUE ldv_state_variable_0 != 0 [L6062] tmp___2 = __VERIFIER_nondet_int() [L6064] case 0: [L6072] case 1: [L6073] COND TRUE ldv_state_variable_0 == 1 [L6074] CALL, EXPR cx82310_driver_init() [L5925] int tmp ; [L5927] CALL, EXPR ldv_usb_register_driver_14(& cx82310_driver, & __this_module, "cx82310_eth") [L6211] ldv_func_ret_type ldv_func_res ; [L6212] int tmp ; [L6214] CALL, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L6487] return __VERIFIER_nondet_int(); [L6214] RET, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L6214] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L6215] ldv_func_res = tmp [L6216] ldv_state_variable_1 = 1 [L6217] usb_counter = 0 [L6218] CALL ldv_usb_driver_1() [L5964] void *tmp ; [L5966] CALL, EXPR ldv_zalloc(1560UL) [L5534] void *p ; [L5535] void *tmp ; [L5536] int tmp___0 ; [L5538] tmp___0 = __VERIFIER_nondet_int() [L5539] COND TRUE tmp___0 != 0 [L5540] return ((void *)0); [L5966] RET, EXPR ldv_zalloc(1560UL) [L5966] tmp = ldv_zalloc(1560UL) [L5967] cx82310_driver_group1 = (struct usb_interface *)tmp [L6218] RET ldv_usb_driver_1() [L6219] return (ldv_func_res); [L5927] RET, EXPR ldv_usb_register_driver_14(& cx82310_driver, & __this_module, "cx82310_eth") [L5927] tmp = ldv_usb_register_driver_14(& cx82310_driver, & __this_module, "cx82310_eth") [L5928] return (tmp); [L6074] RET, EXPR cx82310_driver_init() [L6074] ldv_retval_4 = cx82310_driver_init() [L6075] COND TRUE ldv_retval_4 == 0 [L6076] ldv_state_variable_0 = 3 [L6077] ldv_state_variable_2 = 1 [L6078] CALL ldv_initialize_driver_info_2() [L5949] void *tmp ; [L5950] void *tmp___0 ; [L5951] void *tmp___1 ; [L5953] CALL, EXPR ldv_zalloc(1472UL) [L5534] void *p ; [L5535] void *tmp ; [L5536] int tmp___0 ; [L5538] tmp___0 = __VERIFIER_nondet_int() [L5539] COND TRUE tmp___0 != 0 [L5540] return ((void *)0); [L5953] RET, EXPR ldv_zalloc(1472UL) [L5953] tmp = ldv_zalloc(1472UL) [L5954] cx82310_info_group0 = (struct usbnet *)tmp [L5955] CALL, EXPR ldv_zalloc(1560UL) [L5534] void *p ; [L5535] void *tmp ; [L5536] int tmp___0 ; [L5538] tmp___0 = __VERIFIER_nondet_int() [L5539] COND TRUE tmp___0 != 0 [L5540] return ((void *)0); [L5955] RET, EXPR ldv_zalloc(1560UL) [L5955] tmp___0 = ldv_zalloc(1560UL) [L5956] cx82310_info_group1 = (struct usb_interface *)tmp___0 [L5957] CALL, EXPR ldv_zalloc(232UL) [L5534] void *p ; [L5535] void *tmp ; [L5536] int tmp___0 ; [L5538] tmp___0 = __VERIFIER_nondet_int() [L5539] COND TRUE tmp___0 != 0 [L5540] return ((void *)0); [L5957] RET, EXPR ldv_zalloc(232UL) [L5957] tmp___1 = ldv_zalloc(232UL) [L5958] cx82310_info_group2 = (struct sk_buff *)tmp___1 [L6078] RET ldv_initialize_driver_info_2() [L6081] COND FALSE !(ldv_retval_4 != 0) [L5992] tmp___0 = __VERIFIER_nondet_int() [L5994] case 0: [L6060] case 1: [L6096] case 2: [L6097] COND TRUE ldv_state_variable_2 != 0 [L6098] tmp___3 = __VERIFIER_nondet_int() [L6100] case 0: [L6101] COND TRUE ldv_state_variable_2 == 1 [L6102] CALL cx82310_rx_fixup(cx82310_info_group0, cx82310_info_group2) [L5803] int len ; [L5804] struct sk_buff *skb2 ; [L5805] size_t __len ; [L5806] void *__ret ; [L5807] size_t __len___0 ; [L5808] void *__ret___0 ; [L5809] size_t __len___1 ; [L5810] void *__ret___1 ; [L5811] size_t __len___2 ; [L5812] void *__ret___2 ; [L5814] EXPR dev->data[1] [L5814] COND FALSE !(dev->data[1] != 0UL) [L5872] EXPR skb->len [L5872] COND TRUE skb->len > 1U [L5838] EXPR skb->data [L5838] EXPR skb->data [L5838] EXPR skb->data + 1UL [L5838] len = (int )*(skb->data) | ((int )*(skb->data + 1UL) << 8) [L5839] CALL skb_pull(skb, 2U) [L6465] CALL, EXPR ldv_malloc(sizeof(unsigned char)) [L5517] void *p ; [L5518] void *tmp ; [L5519] int tmp___0 ; [L5521] tmp___0 = __VERIFIER_nondet_int() [L5522] COND TRUE tmp___0 != 0 [L5523] return ((void *)0); [L6465] RET, EXPR ldv_malloc(sizeof(unsigned char)) [L6465] return ldv_malloc(sizeof(unsigned char)); [L5839] RET skb_pull(skb, 2U) [L5840] EXPR skb->len [L5840] (unsigned int )len == skb->len || (unsigned int )(len + 1) == skb->len [L5840] EXPR skb->len [L5840] (unsigned int )len == skb->len || (unsigned int )(len + 1) == skb->len [L5840] COND FALSE !((unsigned int )len == skb->len || (unsigned int )(len + 1) == skb->len) [L5845] COND FALSE !(len > 1514) [L5851] EXPR skb->len [L5851] COND FALSE !((unsigned int )len > skb->len) [L5861] CALL, EXPR ldv_alloc_skb_12((unsigned int )len, 32U) [L6197] struct sk_buff *tmp ; [L6199] CALL, EXPR ldv_skb_alloc() [L6369] void *skb ; [L6370] void *tmp___7 ; [L6372] CALL, EXPR ldv_zalloc(sizeof(struct sk_buff___0 )) [L5534] void *p ; [L5535] void *tmp ; [L5536] int tmp___0 ; [L5538] tmp___0 = __VERIFIER_nondet_int() [L5539] COND FALSE !(tmp___0 != 0) [L5542] EXPR, FCALL calloc(1UL, size) [L5542] tmp = calloc(1UL, size) [L5543] p = tmp [L5544] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) [L5513] COND FALSE !(!cond) [L5544] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) [L5545] return (p); [L6372] RET, EXPR ldv_zalloc(sizeof(struct sk_buff___0 )) [L6372] tmp___7 = ldv_zalloc(sizeof(struct sk_buff___0 )) [L6373] skb = (struct sk_buff___0 *)tmp___7 [L6374] COND FALSE !(! skb) [L6377] CALL ldv_set_add(LDV_SKBS, skb) [L6245] int i ; [L6247] i = 0 [L6248] COND TRUE 1 [L6249] COND FALSE !(i < last_index) [L6259] COND TRUE last_index < 15 [L6260] set_impl[last_index] = e [L6261] last_index = last_index + 1 [L6377] RET ldv_set_add(LDV_SKBS, skb) [L6378] return (skb); [L6199] RET, EXPR ldv_skb_alloc() [L6199] tmp = ldv_skb_alloc() [L6200] COND TRUE \read(*tmp) [L6202] CALL, EXPR ldv_malloc(size) [L5517] void *p ; [L5518] void *tmp ; [L5519] int tmp___0 ; [L5521] tmp___0 = __VERIFIER_nondet_int() [L5522] COND TRUE tmp___0 != 0 [L5523] return ((void *)0); [L6202] RET, EXPR ldv_malloc(size) [L6202] tmp->head = ldv_malloc(size) [L6203] EXPR tmp->head [L6203] tmp->data = tmp->head [L6205] return (tmp); [L5861] RET, EXPR ldv_alloc_skb_12((unsigned int )len, 32U) [L5861] skb2 = ldv_alloc_skb_12((unsigned int )len, 32U) [L5862] COND FALSE !((unsigned long )skb2 == (unsigned long )((struct sk_buff *)0)) [L5866] CALL skb_put(skb2, (unsigned int )len) [L6471] EXPR arg0->data [L6471] EXPR arg0->tail [L6471] unsigned char *ret_val = arg0->data + arg0->tail; [L6472] EXPR arg0->tail [L6472] arg0->tail += arg1 [L6473] return ret_val; [L5866] RET skb_put(skb2, (unsigned int )len) [L5867] __len___2 = (size_t )len [L5868] EXPR skb2->data [L5868] EXPR skb->data [L5868] EXPR, FCALL memcpy((void *)skb2->data, (void const *)skb->data, __len___2) [L5868] __ret___2 = memcpy((void *)skb2->data, (void const *)skb->data, __len___2) [L5869] FCALL usbnet_skb_return(dev, skb2) [L5870] CALL skb_pull(skb, (unsigned int )(len + 1) & 4294967294U) [L6465] CALL, EXPR ldv_malloc(sizeof(unsigned char)) [L5517] void *p ; [L5518] void *tmp ; [L5519] int tmp___0 ; [L5521] tmp___0 = __VERIFIER_nondet_int() [L5522] COND TRUE tmp___0 != 0 [L5523] return ((void *)0); [L6465] RET, EXPR ldv_malloc(sizeof(unsigned char)) [L6465] return ldv_malloc(sizeof(unsigned char)); [L5870] RET skb_pull(skb, (unsigned int )(len + 1) & 4294967294U) [L5872] EXPR skb->len [L5872] COND FALSE !(skb->len > 1U) [L5877] return (1); [L6102] RET cx82310_rx_fixup(cx82310_info_group0, cx82310_info_group2) [L6103] ldv_state_variable_2 = 1 [L6106] COND FALSE !(ldv_state_variable_2 == 2) [L5992] tmp___0 = __VERIFIER_nondet_int() [L5994] case 0: [L6060] case 1: [L6061] COND TRUE ldv_state_variable_0 != 0 [L6062] tmp___2 = __VERIFIER_nondet_int() [L6064] case 0: [L6065] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L6066] CALL cx82310_driver_exit() [L5934] CALL ldv_usb_deregister_15(& cx82310_driver) [L6225] FCALL usb_deregister(arg) [L6226] ldv_state_variable_1 = 0 [L5934] RET ldv_usb_deregister_15(& cx82310_driver) [L6066] RET cx82310_driver_exit() [L6067] ldv_state_variable_0 = 2 [L6156] CALL ldv_check_final_state() [L6436] int tmp___7 ; [L6438] CALL, EXPR ldv_set_is_empty(LDV_SKBS) [L6327] return (last_index == 0); [L6438] RET, EXPR ldv_set_is_empty(LDV_SKBS) [L6438] tmp___7 = ldv_set_is_empty(LDV_SKBS) [L6439] COND FALSE !(\read(tmp___7)) [L6441] CALL ldv_error() [L5569] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 302 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 120.6s, OverallIterations: 12, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 1674 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1647 mSDsluCounter, 26062 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21303 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 766 IncrementalHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 4759 mSDtfsCounter, 766 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2154 GetRequests, 2080 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3087occurred in iteration=11, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 619 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 100.7s InterpolantComputationTime, 1259 NumberOfCodeBlocks, 1245 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2134 ConstructedInterpolants, 0 QuantifiedInterpolants, 3039 SizeOfPredicates, 29 NumberOfNonLiveVariables, 6740 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 1777/1788 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 [2021-11-17 00:56:44,467 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN