./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 5b36d44f 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-wip.dd.seqcomp-5b36d44 [2021-11-07 13:15:12,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 13:15:12,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 13:15:12,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 13:15:12,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 13:15:12,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 13:15:12,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 13:15:12,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 13:15:12,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 13:15:12,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 13:15:12,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 13:15:12,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 13:15:12,209 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 13:15:12,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 13:15:12,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 13:15:12,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 13:15:12,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 13:15:12,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 13:15:12,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 13:15:12,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 13:15:12,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 13:15:12,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 13:15:12,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 13:15:12,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 13:15:12,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 13:15:12,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 13:15:12,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 13:15:12,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 13:15:12,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 13:15:12,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 13:15:12,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 13:15:12,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 13:15:12,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 13:15:12,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 13:15:12,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 13:15:12,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 13:15:12,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 13:15:12,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 13:15:12,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 13:15:12,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 13:15:12,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 13:15:12,245 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-07 13:15:12,276 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 13:15:12,277 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 13:15:12,277 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 13:15:12,277 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 13:15:12,279 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 13:15:12,280 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 13:15:12,280 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 13:15:12,280 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 13:15:12,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 13:15:12,280 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 13:15:12,281 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 13:15:12,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 13:15:12,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 13:15:12,282 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 13:15:12,282 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 13:15:12,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 13:15:12,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 13:15:12,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 13:15:12,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 13:15:12,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 13:15:12,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 13:15:12,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 13:15:12,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 13:15:12,284 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 13:15:12,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 13:15:12,284 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 13:15:12,284 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 13:15:12,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 13:15:12,285 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 13:15:12,286 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-07 13:15:12,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 13:15:12,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 13:15:12,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 13:15:12,524 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 13:15:12,525 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 13:15:12,526 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-07 13:15:12,589 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3c7e8302/90ffaf802755482592e786c84c01fc82/FLAG331ac70af [2021-11-07 13:15:13,137 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 13:15:13,138 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-07 13:15:13,171 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3c7e8302/90ffaf802755482592e786c84c01fc82/FLAG331ac70af [2021-11-07 13:15:13,341 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3c7e8302/90ffaf802755482592e786c84c01fc82 [2021-11-07 13:15:13,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 13:15:13,346 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 13:15:13,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 13:15:13,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 13:15:13,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 13:15:13,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:15:13" (1/1) ... [2021-11-07 13:15:13,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd03b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:13, skipping insertion in model container [2021-11-07 13:15:13,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:15:13" (1/1) ... [2021-11-07 13:15:13,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 13:15:13,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 13:15:13,945 WARN L228 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-07 13:15:14,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 13:15:14,180 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 13:15:14,295 WARN L228 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-07 13:15:14,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 13:15:14,389 INFO L208 MainTranslator]: Completed translation [2021-11-07 13:15:14,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:14 WrapperNode [2021-11-07 13:15:14,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 13:15:14,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 13:15:14,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 13:15:14,392 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 13:15:14,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:14" (1/1) ... [2021-11-07 13:15:14,444 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:14" (1/1) ... [2021-11-07 13:15:14,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 13:15:14,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 13:15:14,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 13:15:14,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 13:15:14,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:14" (1/1) ... [2021-11-07 13:15:14,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:14" (1/1) ... [2021-11-07 13:15:14,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:14" (1/1) ... [2021-11-07 13:15:14,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:14" (1/1) ... [2021-11-07 13:15:14,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:14" (1/1) ... [2021-11-07 13:15:14,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:14" (1/1) ... [2021-11-07 13:15:14,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:14" (1/1) ... [2021-11-07 13:15:14,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 13:15:14,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 13:15:14,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 13:15:14,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 13:15:14,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:14" (1/1) ... [2021-11-07 13:15:14,691 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 13:15:14,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 13:15:14,716 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-07 13:15:14,725 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-07 13:15:14,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-07 13:15:14,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-07 13:15:14,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-07 13:15:14,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 13:15:14,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 13:15:14,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 13:15:14,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 13:15:14,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 13:15:14,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 13:15:14,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 13:15:14,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-07 13:15:14,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 13:15:14,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-07 13:15:14,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 13:15:14,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 13:15:17,555 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 13:15:17,555 INFO L299 CfgBuilder]: Removed 377 assume(true) statements. [2021-11-07 13:15:17,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:15:17 BoogieIcfgContainer [2021-11-07 13:15:17,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 13:15:17,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 13:15:17,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 13:15:17,561 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 13:15:17,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:15:13" (1/3) ... [2021-11-07 13:15:17,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d116f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:15:17, skipping insertion in model container [2021-11-07 13:15:17,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:15:14" (2/3) ... [2021-11-07 13:15:17,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d116f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:15:17, skipping insertion in model container [2021-11-07 13:15:17,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:15:17" (3/3) ... [2021-11-07 13:15:17,564 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-07 13:15:17,568 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 13:15:17,568 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 13:15:17,606 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 13:15:17,612 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-07 13:15:17,612 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 13:15:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 449 states, 447 states have (on average 1.5100671140939597) internal successors, (675), 448 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:17,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 13:15:17,638 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:15:17,638 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:15:17,639 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:15:17,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:15:17,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1795372011, now seen corresponding path program 1 times [2021-11-07 13:15:17,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:15:17,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089133089] [2021-11-07 13:15:17,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:15:17,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:15:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:15:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 13:15:18,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:15:18,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089133089] [2021-11-07 13:15:18,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089133089] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:15:18,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:15:18,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 13:15:18,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725961516] [2021-11-07 13:15:18,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:15:18,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 13:15:18,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:15:18,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 13:15:18,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:15:18,041 INFO L87 Difference]: Start difference. First operand has 449 states, 447 states have (on average 1.5100671140939597) internal successors, (675), 448 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:15:18,386 INFO L93 Difference]: Finished difference Result 1294 states and 1957 transitions. [2021-11-07 13:15:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 13:15:18,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 13:15:18,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:15:18,408 INFO L225 Difference]: With dead ends: 1294 [2021-11-07 13:15:18,408 INFO L226 Difference]: Without dead ends: 838 [2021-11-07 13:15:18,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.96ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:15:18,424 INFO L933 BasicCegarLoop]: 634 mSDtfsCounter, 584 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 178.08ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 15.65ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 209.47ms IncrementalHoareTripleChecker+Time [2021-11-07 13:15:18,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [584 Valid, 1249 Invalid, 15 Unknown, 0 Unchecked, 15.65ms Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 209.47ms Time] [2021-11-07 13:15:18,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2021-11-07 13:15:18,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2021-11-07 13:15:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.4289127837514934) internal successors, (1196), 837 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1196 transitions. [2021-11-07 13:15:18,517 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1196 transitions. Word has length 21 [2021-11-07 13:15:18,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:15:18,517 INFO L470 AbstractCegarLoop]: Abstraction has 838 states and 1196 transitions. [2021-11-07 13:15:18,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:18,519 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1196 transitions. [2021-11-07 13:15:18,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-07 13:15:18,526 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:15:18,526 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:15:18,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 13:15:18,526 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:15:18,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:15:18,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1377357218, now seen corresponding path program 1 times [2021-11-07 13:15:18,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:15:18,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050379660] [2021-11-07 13:15:18,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:15:18,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:15:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:15:18,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 13:15:18,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:15:18,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050379660] [2021-11-07 13:15:18,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050379660] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:15:18,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:15:18,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 13:15:18,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177008527] [2021-11-07 13:15:18,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:15:18,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 13:15:18,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:15:18,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 13:15:18,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-07 13:15:18,706 INFO L87 Difference]: Start difference. First operand 838 states and 1196 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:18,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:15:18,838 INFO L93 Difference]: Finished difference Result 2488 states and 3557 transitions. [2021-11-07 13:15:18,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 13:15:18,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-07 13:15:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:15:18,848 INFO L225 Difference]: With dead ends: 2488 [2021-11-07 13:15:18,848 INFO L226 Difference]: Without dead ends: 1657 [2021-11-07 13:15:18,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.85ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-07 13:15:18,854 INFO L933 BasicCegarLoop]: 615 mSDtfsCounter, 594 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.16ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 2437 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 9.22ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.56ms IncrementalHoareTripleChecker+Time [2021-11-07 13:15:18,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [594 Valid, 2437 Invalid, 65 Unknown, 0 Unchecked, 9.22ms Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 64.56ms Time] [2021-11-07 13:15:18,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2021-11-07 13:15:18,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1657. [2021-11-07 13:15:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1656 states have (on average 1.4251207729468598) internal successors, (2360), 1656 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2360 transitions. [2021-11-07 13:15:18,891 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2360 transitions. Word has length 28 [2021-11-07 13:15:18,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:15:18,892 INFO L470 AbstractCegarLoop]: Abstraction has 1657 states and 2360 transitions. [2021-11-07 13:15:18,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2360 transitions. [2021-11-07 13:15:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-07 13:15:18,896 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:15:18,897 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-11-07 13:15:18,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 13:15:18,898 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:15:18,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:15:18,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1834683196, now seen corresponding path program 1 times [2021-11-07 13:15:18,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:15:18,902 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891473898] [2021-11-07 13:15:18,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:15:18,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:15:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:15:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 13:15:19,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:15:19,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891473898] [2021-11-07 13:15:19,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891473898] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:15:19,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:15:19,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 13:15:19,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81372211] [2021-11-07 13:15:19,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:15:19,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 13:15:19,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:15:19,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 13:15:19,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:15:19,042 INFO L87 Difference]: Start difference. First operand 1657 states and 2360 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:15:19,142 INFO L93 Difference]: Finished difference Result 3483 states and 4983 transitions. [2021-11-07 13:15:19,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 13:15:19,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-11-07 13:15:19,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:15:19,150 INFO L225 Difference]: With dead ends: 3483 [2021-11-07 13:15:19,150 INFO L226 Difference]: Without dead ends: 1838 [2021-11-07 13:15:19,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.67ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:15:19,156 INFO L933 BasicCegarLoop]: 634 mSDtfsCounter, 90 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.96ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.63ms IncrementalHoareTripleChecker+Time [2021-11-07 13:15:19,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 1223 Invalid, 23 Unknown, 0 Unchecked, 1.96ms Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 55.63ms Time] [2021-11-07 13:15:19,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2021-11-07 13:15:19,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1831. [2021-11-07 13:15:19,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1831 states, 1830 states have (on average 1.4360655737704917) internal successors, (2628), 1830 states have internal predecessors, (2628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:19,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2628 transitions. [2021-11-07 13:15:19,212 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2628 transitions. Word has length 50 [2021-11-07 13:15:19,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:15:19,212 INFO L470 AbstractCegarLoop]: Abstraction has 1831 states and 2628 transitions. [2021-11-07 13:15:19,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:19,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2628 transitions. [2021-11-07 13:15:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-07 13:15:19,216 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:15:19,217 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:15:19,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 13:15:19,217 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:15:19,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:15:19,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1294035092, now seen corresponding path program 1 times [2021-11-07 13:15:19,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:15:19,219 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408354972] [2021-11-07 13:15:19,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:15:19,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:15:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:15:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 13:15:19,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:15:19,335 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408354972] [2021-11-07 13:15:19,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408354972] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:15:19,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:15:19,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 13:15:19,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756296042] [2021-11-07 13:15:19,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:15:19,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 13:15:19,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:15:19,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 13:15:19,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:15:19,338 INFO L87 Difference]: Start difference. First operand 1831 states and 2628 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:15:19,721 INFO L93 Difference]: Finished difference Result 3879 states and 5607 transitions. [2021-11-07 13:15:19,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 13:15:19,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-07 13:15:19,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:15:19,728 INFO L225 Difference]: With dead ends: 3879 [2021-11-07 13:15:19,728 INFO L226 Difference]: Without dead ends: 2060 [2021-11-07 13:15:19,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.81ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:15:19,731 INFO L933 BasicCegarLoop]: 689 mSDtfsCounter, 440 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 314.52ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.79ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 340.67ms IncrementalHoareTripleChecker+Time [2021-11-07 13:15:19,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [440 Valid, 935 Invalid, 35 Unknown, 0 Unchecked, 1.79ms Time], IncrementalHoareTripleChecker [12 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 340.67ms Time] [2021-11-07 13:15:19,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2021-11-07 13:15:19,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 2053. [2021-11-07 13:15:19,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2052 states have (on average 1.442495126705653) internal successors, (2960), 2052 states have internal predecessors, (2960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 2960 transitions. [2021-11-07 13:15:19,794 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 2960 transitions. Word has length 64 [2021-11-07 13:15:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:15:19,795 INFO L470 AbstractCegarLoop]: Abstraction has 2053 states and 2960 transitions. [2021-11-07 13:15:19,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:19,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2960 transitions. [2021-11-07 13:15:19,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-11-07 13:15:19,797 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:15:19,797 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:15:19,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 13:15:19,797 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:15:19,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:15:19,798 INFO L85 PathProgramCache]: Analyzing trace with hash 45757330, now seen corresponding path program 1 times [2021-11-07 13:15:19,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:15:19,798 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473180158] [2021-11-07 13:15:19,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:15:19,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:15:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:15:19,920 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-07 13:15:19,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:15:19,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473180158] [2021-11-07 13:15:19,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473180158] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:15:19,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:15:19,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 13:15:19,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559429191] [2021-11-07 13:15:19,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:15:19,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 13:15:19,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:15:19,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 13:15:19,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 13:15:19,923 INFO L87 Difference]: Start difference. First operand 2053 states and 2960 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:20,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:15:20,213 INFO L93 Difference]: Finished difference Result 9247 states and 13428 transitions. [2021-11-07 13:15:20,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 13:15:20,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-11-07 13:15:20,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:15:20,242 INFO L225 Difference]: With dead ends: 9247 [2021-11-07 13:15:20,242 INFO L226 Difference]: Without dead ends: 7206 [2021-11-07 13:15:20,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.35ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 13:15:20,250 INFO L933 BasicCegarLoop]: 1040 mSDtfsCounter, 1591 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.85ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 7.14ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 90.27ms IncrementalHoareTripleChecker+Time [2021-11-07 13:15:20,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1591 Valid, 2648 Invalid, 101 Unknown, 0 Unchecked, 7.14ms Time], IncrementalHoareTripleChecker [20 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 90.27ms Time] [2021-11-07 13:15:20,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7206 states. [2021-11-07 13:15:20,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7206 to 2085. [2021-11-07 13:15:20,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 2084 states have (on average 1.435700575815739) internal successors, (2992), 2084 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:20,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 2992 transitions. [2021-11-07 13:15:20,371 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 2992 transitions. Word has length 64 [2021-11-07 13:15:20,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:15:20,371 INFO L470 AbstractCegarLoop]: Abstraction has 2085 states and 2992 transitions. [2021-11-07 13:15:20,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 2992 transitions. [2021-11-07 13:15:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-07 13:15:20,374 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:15:20,374 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:15:20,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 13:15:20,374 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:15:20,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:15:20,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2089538442, now seen corresponding path program 1 times [2021-11-07 13:15:20,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:15:20,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475137514] [2021-11-07 13:15:20,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:15:20,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:15:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:15:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-07 13:15:20,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:15:20,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475137514] [2021-11-07 13:15:20,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475137514] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:15:20,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:15:20,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-07 13:15:20,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66632641] [2021-11-07 13:15:20,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:15:20,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-07 13:15:20,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:15:20,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-07 13:15:20,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-11-07 13:15:20,490 INFO L87 Difference]: Start difference. First operand 2085 states and 2992 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:15:21,421 INFO L93 Difference]: Finished difference Result 10761 states and 15626 transitions. [2021-11-07 13:15:21,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-07 13:15:21,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-07 13:15:21,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:15:21,452 INFO L225 Difference]: With dead ends: 10761 [2021-11-07 13:15:21,453 INFO L226 Difference]: Without dead ends: 8688 [2021-11-07 13:15:21,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 157.98ms TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2021-11-07 13:15:21,458 INFO L933 BasicCegarLoop]: 2416 mSDtfsCounter, 5178 mSDsluCounter, 9136 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 350.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5178 SdHoareTripleChecker+Valid, 11552 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 24.19ms SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 427.43ms IncrementalHoareTripleChecker+Time [2021-11-07 13:15:21,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5178 Valid, 11552 Invalid, 683 Unknown, 0 Unchecked, 24.19ms Time], IncrementalHoareTripleChecker [56 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 427.43ms Time] [2021-11-07 13:15:21,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8688 states. [2021-11-07 13:15:21,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8688 to 2117. [2021-11-07 13:15:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 2116 states have (on average 1.4291115311909264) internal successors, (3024), 2116 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:21,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3024 transitions. [2021-11-07 13:15:21,607 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3024 transitions. Word has length 67 [2021-11-07 13:15:21,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:15:21,607 INFO L470 AbstractCegarLoop]: Abstraction has 2117 states and 3024 transitions. [2021-11-07 13:15:21,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:21,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3024 transitions. [2021-11-07 13:15:21,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-07 13:15:21,609 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:15:21,610 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:15:21,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 13:15:21,610 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:15:21,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:15:21,611 INFO L85 PathProgramCache]: Analyzing trace with hash -536003665, now seen corresponding path program 1 times [2021-11-07 13:15:21,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:15:21,611 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627009343] [2021-11-07 13:15:21,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:15:21,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:15:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:15:21,764 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-07 13:15:21,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:15:21,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627009343] [2021-11-07 13:15:21,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627009343] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:15:21,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:15:21,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 13:15:21,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785781884] [2021-11-07 13:15:21,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:15:21,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 13:15:21,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:15:21,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 13:15:21,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:15:21,767 INFO L87 Difference]: Start difference. First operand 2117 states and 3024 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:15:21,877 INFO L93 Difference]: Finished difference Result 4227 states and 6041 transitions. [2021-11-07 13:15:21,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 13:15:21,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-11-07 13:15:21,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:15:21,886 INFO L225 Difference]: With dead ends: 4227 [2021-11-07 13:15:21,887 INFO L226 Difference]: Without dead ends: 2119 [2021-11-07 13:15:21,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.36ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:15:21,891 INFO L933 BasicCegarLoop]: 623 mSDtfsCounter, 0 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.94ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.98ms IncrementalHoareTripleChecker+Time [2021-11-07 13:15:21,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1242 Invalid, 8 Unknown, 0 Unchecked, 1.94ms Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 8.98ms Time] [2021-11-07 13:15:21,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2021-11-07 13:15:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2119. [2021-11-07 13:15:21,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2119 states, 2118 states have (on average 1.428706326723324) internal successors, (3026), 2118 states have internal predecessors, (3026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 3026 transitions. [2021-11-07 13:15:21,997 INFO L78 Accepts]: Start accepts. Automaton has 2119 states and 3026 transitions. Word has length 69 [2021-11-07 13:15:21,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:15:21,997 INFO L470 AbstractCegarLoop]: Abstraction has 2119 states and 3026 transitions. [2021-11-07 13:15:21,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 3026 transitions. [2021-11-07 13:15:22,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-07 13:15:22,000 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:15:22,000 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:15:22,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 13:15:22,000 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:15:22,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:15:22,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1502691923, now seen corresponding path program 1 times [2021-11-07 13:15:22,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:15:22,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853468197] [2021-11-07 13:15:22,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:15:22,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:15:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:15:22,128 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-07 13:15:22,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:15:22,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853468197] [2021-11-07 13:15:22,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853468197] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 13:15:22,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739429797] [2021-11-07 13:15:22,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:15:22,129 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 13:15:22,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 13:15:22,135 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-07 13:15:22,162 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-07 13:15:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:15:22,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-07 13:15:22,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 13:15:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-07 13:15:22,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 13:15:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-07 13:15:22,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739429797] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 13:15:22,834 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-07 13:15:22,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-07 13:15:22,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136577664] [2021-11-07 13:15:22,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-07 13:15:22,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 13:15:22,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:15:22,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 13:15:22,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-07 13:15:22,835 INFO L87 Difference]: Start difference. First operand 2119 states and 3026 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:23,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:15:23,055 INFO L93 Difference]: Finished difference Result 4234 states and 6052 transitions. [2021-11-07 13:15:23,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-07 13:15:23,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-07 13:15:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:15:23,064 INFO L225 Difference]: With dead ends: 4234 [2021-11-07 13:15:23,064 INFO L226 Difference]: Without dead ends: 2125 [2021-11-07 13:15:23,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 75.16ms TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2021-11-07 13:15:23,068 INFO L933 BasicCegarLoop]: 623 mSDtfsCounter, 611 mSDsluCounter, 1865 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.06ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.80ms IncrementalHoareTripleChecker+Time [2021-11-07 13:15:23,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [611 Valid, 2488 Invalid, 36 Unknown, 0 Unchecked, 4.06ms Time], IncrementalHoareTripleChecker [14 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 34.80ms Time] [2021-11-07 13:15:23,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2021-11-07 13:15:23,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2125. [2021-11-07 13:15:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2125 states, 2124 states have (on average 1.4274952919020716) internal successors, (3032), 2124 states have internal predecessors, (3032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:23,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 3032 transitions. [2021-11-07 13:15:23,188 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 3032 transitions. Word has length 71 [2021-11-07 13:15:23,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:15:23,188 INFO L470 AbstractCegarLoop]: Abstraction has 2125 states and 3032 transitions. [2021-11-07 13:15:23,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:23,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 3032 transitions. [2021-11-07 13:15:23,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-07 13:15:23,191 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:15:23,191 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:15:23,222 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-07 13:15:23,407 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-07 13:15:23,408 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:15:23,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:15:23,408 INFO L85 PathProgramCache]: Analyzing trace with hash 21460015, now seen corresponding path program 2 times [2021-11-07 13:15:23,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:15:23,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732028345] [2021-11-07 13:15:23,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:15:23,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:15:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:15:23,724 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-07 13:15:23,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:15:23,725 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732028345] [2021-11-07 13:15:23,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732028345] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:15:23,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:15:23,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-07 13:15:23,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126456242] [2021-11-07 13:15:23,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:15:23,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-07 13:15:23,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:15:23,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-07 13:15:23,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-11-07 13:15:23,726 INFO L87 Difference]: Start difference. First operand 2125 states and 3032 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:26,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:15:26,118 INFO L93 Difference]: Finished difference Result 12013 states and 17426 transitions. [2021-11-07 13:15:26,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-07 13:15:26,119 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-11-07 13:15:26,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:15:26,153 INFO L225 Difference]: With dead ends: 12013 [2021-11-07 13:15:26,153 INFO L226 Difference]: Without dead ends: 9908 [2021-11-07 13:15:26,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 791.63ms TimeCoverageRelationStatistics Valid=316, Invalid=806, Unknown=0, NotChecked=0, Total=1122 [2021-11-07 13:15:26,159 INFO L933 BasicCegarLoop]: 1530 mSDtfsCounter, 9337 mSDsluCounter, 9263 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 684.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9337 SdHoareTripleChecker+Valid, 10793 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 23.23ms SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 804.79ms IncrementalHoareTripleChecker+Time [2021-11-07 13:15:26,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9337 Valid, 10793 Invalid, 859 Unknown, 0 Unchecked, 23.23ms Time], IncrementalHoareTripleChecker [54 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 804.79ms Time] [2021-11-07 13:15:26,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9908 states. [2021-11-07 13:15:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9908 to 2237. [2021-11-07 13:15:26,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2237 states, 2236 states have (on average 1.4060822898032201) internal successors, (3144), 2236 states have internal predecessors, (3144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 3144 transitions. [2021-11-07 13:15:26,464 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 3144 transitions. Word has length 77 [2021-11-07 13:15:26,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:15:26,464 INFO L470 AbstractCegarLoop]: Abstraction has 2237 states and 3144 transitions. [2021-11-07 13:15:26,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:26,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 3144 transitions. [2021-11-07 13:15:26,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-07 13:15:26,467 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:15:26,467 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:15:26,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 13:15:26,467 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:15:26,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:15:26,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1164854511, now seen corresponding path program 1 times [2021-11-07 13:15:26,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:15:26,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538374091] [2021-11-07 13:15:26,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:15:26,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:15:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:15:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-07 13:15:27,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:15:27,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538374091] [2021-11-07 13:15:27,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538374091] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:15:27,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:15:27,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-11-07 13:15:27,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752391564] [2021-11-07 13:15:27,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:15:27,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-07 13:15:27,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:15:27,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-07 13:15:27,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-11-07 13:15:27,038 INFO L87 Difference]: Start difference. First operand 2237 states and 3144 transitions. Second operand has 19 states, 19 states have (on average 4.368421052631579) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:38,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:15:38,383 INFO L93 Difference]: Finished difference Result 15909 states and 23062 transitions. [2021-11-07 13:15:38,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-11-07 13:15:38,385 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.368421052631579) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-11-07 13:15:38,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:15:38,413 INFO L225 Difference]: With dead ends: 15909 [2021-11-07 13:15:38,413 INFO L226 Difference]: Without dead ends: 13692 [2021-11-07 13:15:38,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1222.16ms TimeCoverageRelationStatistics Valid=439, Invalid=1631, Unknown=0, NotChecked=0, Total=2070 [2021-11-07 13:15:38,422 INFO L933 BasicCegarLoop]: 1130 mSDtfsCounter, 7975 mSDsluCounter, 11462 mSDsCounter, 0 mSdLazyCounter, 2645 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8675.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7975 SdHoareTripleChecker+Valid, 12592 SdHoareTripleChecker+Invalid, 2869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 31.93ms SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 2645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9263.72ms IncrementalHoareTripleChecker+Time [2021-11-07 13:15:38,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7975 Valid, 12592 Invalid, 2869 Unknown, 0 Unchecked, 31.93ms Time], IncrementalHoareTripleChecker [224 Valid, 2645 Invalid, 0 Unknown, 0 Unchecked, 9263.72ms Time] [2021-11-07 13:15:38,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13692 states. [2021-11-07 13:15:38,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13692 to 4305. [2021-11-07 13:15:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4305 states, 4304 states have (on average 1.4026486988847584) internal successors, (6037), 4304 states have internal predecessors, (6037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:38,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4305 states to 4305 states and 6037 transitions. [2021-11-07 13:15:38,936 INFO L78 Accepts]: Start accepts. Automaton has 4305 states and 6037 transitions. Word has length 89 [2021-11-07 13:15:38,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:15:38,936 INFO L470 AbstractCegarLoop]: Abstraction has 4305 states and 6037 transitions. [2021-11-07 13:15:38,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.368421052631579) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:38,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4305 states and 6037 transitions. [2021-11-07 13:15:38,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-07 13:15:38,941 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:15:38,941 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:15:38,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 13:15:38,942 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:15:38,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:15:38,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1787911897, now seen corresponding path program 1 times [2021-11-07 13:15:38,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:15:38,943 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133879173] [2021-11-07 13:15:38,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:15:38,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:15:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:15:39,116 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-07 13:15:39,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:15:39,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133879173] [2021-11-07 13:15:39,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133879173] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 13:15:39,117 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986773755] [2021-11-07 13:15:39,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:15:39,117 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 13:15:39,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 13:15:39,118 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-07 13:15:39,150 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-07 13:15:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:15:39,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 1143 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-07 13:15:39,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 13:15:39,656 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-07 13:15:39,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 13:15:39,802 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-07 13:15:39,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986773755] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-07 13:15:39,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-07 13:15:39,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2021-11-07 13:15:39,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716203700] [2021-11-07 13:15:39,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:15:39,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 13:15:39,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:15:39,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 13:15:39,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-07 13:15:39,805 INFO L87 Difference]: Start difference. First operand 4305 states and 6037 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:41,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:15:41,315 INFO L93 Difference]: Finished difference Result 12955 states and 18241 transitions. [2021-11-07 13:15:41,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 13:15:41,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-11-07 13:15:41,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:15:41,330 INFO L225 Difference]: With dead ends: 12955 [2021-11-07 13:15:41,331 INFO L226 Difference]: Without dead ends: 8670 [2021-11-07 13:15:41,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 176 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 28.17ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-07 13:15:41,338 INFO L933 BasicCegarLoop]: 1179 mSDtfsCounter, 568 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 723.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 2274 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.34ms SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 798.94ms IncrementalHoareTripleChecker+Time [2021-11-07 13:15:41,338 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [568 Valid, 2274 Invalid, 237 Unknown, 0 Unchecked, 3.34ms Time], IncrementalHoareTripleChecker [53 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 798.94ms Time] [2021-11-07 13:15:41,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8670 states. [2021-11-07 13:15:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8670 to 4529. [2021-11-07 13:15:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4529 states, 4528 states have (on average 1.407464664310954) internal successors, (6373), 4528 states have internal predecessors, (6373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:41,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4529 states to 4529 states and 6373 transitions. [2021-11-07 13:15:41,897 INFO L78 Accepts]: Start accepts. Automaton has 4529 states and 6373 transitions. Word has length 90 [2021-11-07 13:15:41,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:15:41,898 INFO L470 AbstractCegarLoop]: Abstraction has 4529 states and 6373 transitions. [2021-11-07 13:15:41,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:41,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4529 states and 6373 transitions. [2021-11-07 13:15:41,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-11-07 13:15:41,902 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:15:41,902 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:15:41,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-11-07 13:15:42,123 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,SelfDestructingSolverStorable10 [2021-11-07 13:15:42,124 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:15:42,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:15:42,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1444775063, now seen corresponding path program 1 times [2021-11-07 13:15:42,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:15:42,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451794042] [2021-11-07 13:15:42,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:15:42,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:15:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:15:42,239 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-07 13:15:42,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:15:42,240 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451794042] [2021-11-07 13:15:42,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451794042] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 13:15:42,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:15:42,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 13:15:42,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472421403] [2021-11-07 13:15:42,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-07 13:15:42,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 13:15:42,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:15:42,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 13:15:42,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 13:15:42,242 INFO L87 Difference]: Start difference. First operand 4529 states and 6373 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:43,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:15:43,534 INFO L93 Difference]: Finished difference Result 13179 states and 18465 transitions. [2021-11-07 13:15:43,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 13:15:43,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2021-11-07 13:15:43,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:15:43,551 INFO L225 Difference]: With dead ends: 13179 [2021-11-07 13:15:43,551 INFO L226 Difference]: Without dead ends: 8670 [2021-11-07 13:15:43,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.64ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 13:15:43,560 INFO L933 BasicCegarLoop]: 1067 mSDtfsCounter, 1122 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 565.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.09ms SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 621.88ms IncrementalHoareTripleChecker+Time [2021-11-07 13:15:43,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1122 Valid, 2205 Invalid, 193 Unknown, 0 Unchecked, 3.09ms Time], IncrementalHoareTripleChecker [41 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 621.88ms Time] [2021-11-07 13:15:43,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8670 states. [2021-11-07 13:15:44,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8670 to 4641. [2021-11-07 13:15:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4641 states, 4640 states have (on average 1.3959051724137932) internal successors, (6477), 4640 states have internal predecessors, (6477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4641 states to 4641 states and 6477 transitions. [2021-11-07 13:15:44,193 INFO L78 Accepts]: Start accepts. Automaton has 4641 states and 6477 transitions. Word has length 90 [2021-11-07 13:15:44,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:15:44,194 INFO L470 AbstractCegarLoop]: Abstraction has 4641 states and 6477 transitions. [2021-11-07 13:15:44,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:15:44,195 INFO L276 IsEmpty]: Start isEmpty. Operand 4641 states and 6477 transitions. [2021-11-07 13:15:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-07 13:15:44,201 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:15:44,201 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:15:44,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 13:15:44,202 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:15:44,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:15:44,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1508746801, now seen corresponding path program 1 times [2021-11-07 13:15:44,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 13:15:44,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619438696] [2021-11-07 13:15:44,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:15:44,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 13:15:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:15:45,326 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-07 13:15:45,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 13:15:45,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619438696] [2021-11-07 13:15:45,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619438696] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 13:15:45,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163343408] [2021-11-07 13:15:45,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:15:45,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 13:15:45,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 13:15:45,331 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-07 13:15:45,341 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-07 13:15:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:15:45,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 97 conjunts are in the unsatisfiable core [2021-11-07 13:15:45,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 13:15:46,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-11-07 13:15:46,519 INFO L354 Elim1Store]: treesize reduction 70, result has 24.7 percent of original size [2021-11-07 13:15:46,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 61 [2021-11-07 13:15:46,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 1 [2021-11-07 13:15:52,102 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-07 13:15:52,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-11-07 13:15:52,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 13:15:52,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2021-11-07 13:15:52,121 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2021-11-07 13:15:52,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2021-11-07 13:15:55,418 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2021-11-07 13:15:55,459 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-11-07 13:15:55,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 25 [2021-11-07 13:15:55,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 13:15:55,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 13:15:55,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 13:15:55,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 25 [2021-11-07 13:15:58,689 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-07 13:15:58,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 93 [2021-11-07 13:15:58,697 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-07 13:15:58,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 69 [2021-11-07 13:16:00,885 INFO L354 Elim1Store]: treesize reduction 26, result has 16.1 percent of original size [2021-11-07 13:16:00,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 78 [2021-11-07 13:16:00,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-07 13:16:00,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 79 [2021-11-07 13:16:07,024 INFO L354 Elim1Store]: treesize reduction 30, result has 14.3 percent of original size [2021-11-07 13:16:07,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 85 [2021-11-07 13:16:07,042 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-07 13:16:07,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 86 [2021-11-07 13:16:37,756 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-07 13:16:37,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 75 [2021-11-07 13:16:37,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-07 13:16:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-07 13:16:37,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 13:16:39,319 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| Int) (v_DerPreprocessor_4 Int)) (let ((.cse1 (+ 232 c_ULTIMATE.start_cx82310_rx_fixup_~skb2~0.offset))) (or (< 0 (mod (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_cx82310_rx_fixup_~skb2~0.base) .cse1))) (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| v_DerPreprocessor_4))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base) (+ 460 c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) 18446744073709551616)) (< (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_cx82310_rx_fixup_~skb2~0.base) .cse1) |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59|)))) is different from false [2021-11-07 13:17:19,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 158 [2021-11-07 13:17:19,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 230 [2021-11-07 13:17:21,544 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset Int) (v_DerPreprocessor_8 Int) (|v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_4 Int) (v_ULTIMATE.start_skb_put_~arg1_9 Int)) (or (< |c_ULTIMATE.start_ldv_malloc_#res.offset| |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59|) (< 0 (mod (select (select (let ((.cse0 (store |c_#memory_int| c_ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.base (let ((.cse1 (store (store (select |c_#memory_int| c_ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.base) (+ ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset 224) v_DerPreprocessor_8) (+ 232 ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_7)) (.cse2 (+ ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset 216))) (store .cse1 .cse2 (+ (select .cse1 .cse2) v_ULTIMATE.start_skb_put_~arg1_9)))))) (store .cse0 |c_ULTIMATE.start_ldv_malloc_#res.base| (store (select .cse0 |c_ULTIMATE.start_ldv_malloc_#res.base|) |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| v_DerPreprocessor_4))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base) (+ 460 c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) 18446744073709551616)))) is different from false [2021-11-07 13:19:06,257 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_9 Int) (ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset Int) (v_DerPreprocessor_8 Int) (|v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| Int) (|~#set_impl~0.offset| Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_4 Int) (~last_index~0 Int) (v_ULTIMATE.start_skb_put_~arg1_9 Int)) (or (< 0 (mod (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_~#set_impl~0.base| (store (select |c_#memory_int| |c_~#set_impl~0.base|) (+ (* ~last_index~0 8) |~#set_impl~0.offset|) v_DerPreprocessor_9)))) (store .cse1 |c_ULTIMATE.start_ldv_zalloc_#res.base| (let ((.cse2 (store (store (select .cse1 |c_ULTIMATE.start_ldv_zalloc_#res.base|) (+ ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset 224) v_DerPreprocessor_8) (+ 232 ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_7)) (.cse3 (+ ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset 216))) (store .cse2 .cse3 (+ (select .cse2 .cse3) v_ULTIMATE.start_skb_put_~arg1_9))))))) (store .cse0 0 (store (select .cse0 0) |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| v_DerPreprocessor_4))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base) (+ 460 c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) 18446744073709551616)) (< 0 |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59|))) is different from false [2021-11-07 13:19:31,960 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_9 Int) (ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset Int) (v_DerPreprocessor_8 Int) (|v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| Int) (|~#set_impl~0.offset| Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_4 Int) (~last_index~0 Int) (v_ULTIMATE.start_skb_put_~arg1_9 Int)) (or (< 0 (mod (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_~#set_impl~0.base| (store (select |c_#memory_int| |c_~#set_impl~0.base|) (+ (* ~last_index~0 8) |~#set_impl~0.offset|) v_DerPreprocessor_9)))) (store .cse1 |c_ULTIMATE.start_ldv_zalloc_#t~malloc35.base| (let ((.cse2 (store (store (select .cse1 |c_ULTIMATE.start_ldv_zalloc_#t~malloc35.base|) (+ ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset 224) v_DerPreprocessor_8) (+ 232 ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_7)) (.cse3 (+ ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset 216))) (store .cse2 .cse3 (+ (select .cse2 .cse3) v_ULTIMATE.start_skb_put_~arg1_9))))))) (store .cse0 0 (store (select .cse0 0) |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| v_DerPreprocessor_4))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base) (+ 460 c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) 18446744073709551616)) (< 0 |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59|))) is different from false [2021-11-07 13:19:34,072 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_34| Int) (v_DerPreprocessor_9 Int) (ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset Int) (v_DerPreprocessor_8 Int) (|v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| Int) (|~#set_impl~0.offset| Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_4 Int) (~last_index~0 Int) (v_ULTIMATE.start_skb_put_~arg1_9 Int)) (or (= |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_34| 0) (< 0 (mod (select (select (let ((.cse0 (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_34| ((as const (Array Int Int)) 0)))) (store .cse4 |c_~#set_impl~0.base| (store (select .cse4 |c_~#set_impl~0.base|) (+ (* ~last_index~0 8) |~#set_impl~0.offset|) v_DerPreprocessor_9))))) (store .cse1 |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_34| (let ((.cse2 (store (store (select .cse1 |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_34|) (+ ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset 224) v_DerPreprocessor_8) (+ 232 ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_7)) (.cse3 (+ ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset 216))) (store .cse2 .cse3 (+ v_ULTIMATE.start_skb_put_~arg1_9 (select .cse2 .cse3)))))))) (store .cse0 0 (store (select .cse0 0) |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59| v_DerPreprocessor_4))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base) (+ 460 c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) 18446744073709551616)) (< 0 |v_ULTIMATE.start_#Ultimate.C_memcpy_dest.offset_59|))) is different from false [2021-11-07 13:19:44,780 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (ite Bool Int (Array Int Int)) [2021-11-07 13:19:44,781 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-07 13:19:44,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2021-11-07 13:19:44,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015895101] [2021-11-07 13:19:44,781 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-07 13:19:44,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-07 13:19:44,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 13:19:44,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-07 13:19:44,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=3456, Unknown=77, NotChecked=620, Total=4422 [2021-11-07 13:19:44,784 INFO L87 Difference]: Start difference. First operand 4641 states and 6477 transitions. Second operand has 25 states, 25 states have (on average 3.4) internal successors, (85), 24 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:19:44,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-07 13:19:44,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1194 ImplicationChecksByTransitivity, 237332.44ms TimeCoverageRelationStatistics Valid=269, Invalid=3456, Unknown=77, NotChecked=620, Total=4422 [2021-11-07 13:19:44,786 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.03ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-07 13:19:44,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.03ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-07 13:19:44,809 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-07 13:19:44,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 13:19:45,000 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@40e9a184 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-07 13:19:45,004 INFO L158 Benchmark]: Toolchain (without parser) took 271657.60ms. Allocated memory was 117.4MB in the beginning and 830.5MB in the end (delta: 713.0MB). Free memory was 93.9MB in the beginning and 352.4MB in the end (delta: -258.5MB). Peak memory consumption was 454.8MB. Max. memory is 16.1GB. [2021-11-07 13:19:45,004 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 90.2MB. Free memory was 49.8MB in the beginning and 49.7MB in the end (delta: 45.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-07 13:19:45,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1042.21ms. Allocated memory is still 117.4MB. Free memory was 93.9MB in the beginning and 56.0MB in the end (delta: 37.9MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. [2021-11-07 13:19:45,004 INFO L158 Benchmark]: Boogie Procedure Inliner took 147.97ms. Allocated memory is still 117.4MB. Free memory was 56.0MB in the beginning and 69.7MB in the end (delta: -13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-07 13:19:45,005 INFO L158 Benchmark]: Boogie Preprocessor took 143.30ms. Allocated memory is still 117.4MB. Free memory was 69.7MB in the beginning and 56.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-07 13:19:45,005 INFO L158 Benchmark]: RCFGBuilder took 2872.99ms. Allocated memory was 117.4MB in the beginning and 220.2MB in the end (delta: 102.8MB). Free memory was 56.5MB in the beginning and 108.2MB in the end (delta: -51.7MB). Peak memory consumption was 84.6MB. Max. memory is 16.1GB. [2021-11-07 13:19:45,007 INFO L158 Benchmark]: TraceAbstraction took 267444.78ms. Allocated memory was 220.2MB in the beginning and 830.5MB in the end (delta: 610.3MB). Free memory was 108.2MB in the beginning and 352.4MB in the end (delta: -244.2MB). Peak memory consumption was 366.6MB. Max. memory is 16.1GB. [2021-11-07 13:19:45,012 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 90.2MB. Free memory was 49.8MB in the beginning and 49.7MB in the end (delta: 45.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1042.21ms. Allocated memory is still 117.4MB. Free memory was 93.9MB in the beginning and 56.0MB in the end (delta: 37.9MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 147.97ms. Allocated memory is still 117.4MB. Free memory was 56.0MB in the beginning and 69.7MB in the end (delta: -13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 143.30ms. Allocated memory is still 117.4MB. Free memory was 69.7MB in the beginning and 56.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 2872.99ms. Allocated memory was 117.4MB in the beginning and 220.2MB in the end (delta: 102.8MB). Free memory was 56.5MB in the beginning and 108.2MB in the end (delta: -51.7MB). Peak memory consumption was 84.6MB. Max. memory is 16.1GB. * TraceAbstraction took 267444.78ms. Allocated memory was 220.2MB in the beginning and 830.5MB in the end (delta: 610.3MB). Free memory was 108.2MB in the beginning and 352.4MB in the end (delta: -244.2MB). Peak memory consumption was 366.6MB. 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@40e9a184 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@40e9a184: 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-07 13:19:45,242 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 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-wip.dd.seqcomp-5b36d44 [2021-11-07 13:19:46,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 13:19:46,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 13:19:46,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 13:19:46,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 13:19:46,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 13:19:46,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 13:19:46,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 13:19:46,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 13:19:46,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 13:19:46,912 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 13:19:46,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 13:19:46,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 13:19:46,914 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 13:19:46,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 13:19:46,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 13:19:46,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 13:19:46,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 13:19:46,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 13:19:46,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 13:19:46,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 13:19:46,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 13:19:46,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 13:19:46,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 13:19:46,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 13:19:46,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 13:19:46,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 13:19:46,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 13:19:46,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 13:19:46,929 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 13:19:46,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 13:19:46,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 13:19:46,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 13:19:46,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 13:19:46,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 13:19:46,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 13:19:46,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 13:19:46,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 13:19:46,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 13:19:46,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 13:19:46,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 13:19:46,935 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-11-07 13:19:46,963 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 13:19:46,964 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 13:19:46,965 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 13:19:46,965 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 13:19:46,967 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 13:19:46,967 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 13:19:46,967 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 13:19:46,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 13:19:46,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 13:19:46,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 13:19:46,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 13:19:46,968 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 13:19:46,968 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-07 13:19:46,969 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-07 13:19:46,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 13:19:46,969 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 13:19:46,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 13:19:46,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 13:19:46,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 13:19:46,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 13:19:46,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 13:19:46,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 13:19:46,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 13:19:46,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 13:19:46,971 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-07 13:19:46,971 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-07 13:19:46,971 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 13:19:46,971 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 13:19:46,971 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 13:19:46,971 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 13:19:46,972 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 13:19:46,972 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-07 13:19:47,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 13:19:47,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 13:19:47,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 13:19:47,294 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 13:19:47,295 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 13:19:47,296 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-07 13:19:47,353 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/859f73bbf/7bb55f2fce7040ce8c26dc280398749b/FLAG6b652ed81 [2021-11-07 13:19:48,045 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 13:19:48,045 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-07 13:19:48,080 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/859f73bbf/7bb55f2fce7040ce8c26dc280398749b/FLAG6b652ed81 [2021-11-07 13:19:48,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/859f73bbf/7bb55f2fce7040ce8c26dc280398749b [2021-11-07 13:19:48,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 13:19:48,358 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 13:19:48,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 13:19:48,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 13:19:48,363 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 13:19:48,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:19:48" (1/1) ... [2021-11-07 13:19:48,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1adfeb8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:48, skipping insertion in model container [2021-11-07 13:19:48,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:19:48" (1/1) ... [2021-11-07 13:19:48,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 13:19:48,464 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 13:19:48,973 WARN L228 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-07 13:19:49,192 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 13:19:49,223 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 13:19:49,341 WARN L228 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-07 13:19:49,425 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 13:19:49,465 INFO L208 MainTranslator]: Completed translation [2021-11-07 13:19:49,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:49 WrapperNode [2021-11-07 13:19:49,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 13:19:49,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 13:19:49,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 13:19:49,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 13:19:49,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:49" (1/1) ... [2021-11-07 13:19:49,510 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:49" (1/1) ... [2021-11-07 13:19:49,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 13:19:49,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 13:19:49,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 13:19:49,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 13:19:49,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:49" (1/1) ... [2021-11-07 13:19:49,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:49" (1/1) ... [2021-11-07 13:19:49,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:49" (1/1) ... [2021-11-07 13:19:49,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:49" (1/1) ... [2021-11-07 13:19:49,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:49" (1/1) ... [2021-11-07 13:19:49,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:49" (1/1) ... [2021-11-07 13:19:49,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:49" (1/1) ... [2021-11-07 13:19:49,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 13:19:49,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 13:19:49,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 13:19:49,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 13:19:49,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:49" (1/1) ... [2021-11-07 13:19:49,786 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 13:19:49,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 13:19:49,808 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-07 13:19:49,824 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-07 13:19:49,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-11-07 13:19:49,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-11-07 13:19:49,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-07 13:19:49,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-07 13:19:49,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-07 13:19:49,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-11-07 13:19:49,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-11-07 13:19:49,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-11-07 13:19:49,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-11-07 13:19:49,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 13:19:49,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 13:19:49,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 13:19:49,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-11-07 13:19:49,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-11-07 13:19:49,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-11-07 13:19:49,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 13:19:49,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-11-07 13:19:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-11-07 13:19:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-11-07 13:19:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-07 13:19:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 13:19:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-07 13:19:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-07 13:19:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-11-07 13:19:49,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-11-07 13:19:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-11-07 13:19:49,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 13:19:49,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 13:20:02,078 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 13:20:02,087 INFO L299 CfgBuilder]: Removed 377 assume(true) statements. [2021-11-07 13:20:02,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:20:02 BoogieIcfgContainer [2021-11-07 13:20:02,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 13:20:02,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 13:20:02,092 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 13:20:02,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 13:20:02,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:19:48" (1/3) ... [2021-11-07 13:20:02,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491babd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:20:02, skipping insertion in model container [2021-11-07 13:20:02,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:19:49" (2/3) ... [2021-11-07 13:20:02,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491babd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:20:02, skipping insertion in model container [2021-11-07 13:20:02,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:20:02" (3/3) ... [2021-11-07 13:20:02,097 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-07 13:20:02,101 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 13:20:02,101 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-07 13:20:02,141 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 13:20:02,147 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-07 13:20:02,147 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-07 13:20:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 449 states, 447 states have (on average 1.5100671140939597) internal successors, (675), 448 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:02,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 13:20:02,176 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:20:02,176 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:20:02,177 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:20:02,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:20:02,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1795372011, now seen corresponding path program 1 times [2021-11-07 13:20:02,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 13:20:02,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97901315] [2021-11-07 13:20:02,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:20:02,196 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 13:20:02,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 13:20:02,203 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-07 13:20:02,209 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-07 13:20:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:20:02,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-07 13:20:02,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 13:20:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 13:20:02,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 13:20:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 13:20:03,013 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 13:20:03,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97901315] [2021-11-07 13:20:03,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97901315] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 13:20:03,014 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:20:03,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-07 13:20:03,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692849449] [2021-11-07 13:20:03,016 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 13:20:03,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 13:20:03,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 13:20:03,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 13:20:03,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 13:20:03,056 INFO L87 Difference]: Start difference. First operand has 449 states, 447 states have (on average 1.5100671140939597) internal successors, (675), 448 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:03,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:20:03,202 INFO L93 Difference]: Finished difference Result 897 states and 1351 transitions. [2021-11-07 13:20:03,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 13:20:03,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-07 13:20:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:20:03,216 INFO L225 Difference]: With dead ends: 897 [2021-11-07 13:20:03,216 INFO L226 Difference]: Without dead ends: 445 [2021-11-07 13:20:03,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 117.74ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 13:20:03,223 INFO L933 BasicCegarLoop]: 635 mSDtfsCounter, 0 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.57ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 75.63ms IncrementalHoareTripleChecker+Time [2021-11-07 13:20:03,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1897 Invalid, 15 Unknown, 0 Unchecked, 10.57ms Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 75.63ms Time] [2021-11-07 13:20:03,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-11-07 13:20:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2021-11-07 13:20:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 1.4166666666666667) internal successors, (629), 444 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 629 transitions. [2021-11-07 13:20:03,274 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 629 transitions. Word has length 21 [2021-11-07 13:20:03,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:20:03,274 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 629 transitions. [2021-11-07 13:20:03,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 629 transitions. [2021-11-07 13:20:03,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 13:20:03,276 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:20:03,276 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:20:03,292 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-07 13:20:03,486 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-07 13:20:03,487 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:20:03,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:20:03,487 INFO L85 PathProgramCache]: Analyzing trace with hash -815280085, now seen corresponding path program 1 times [2021-11-07 13:20:03,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 13:20:03,488 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549181881] [2021-11-07 13:20:03,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:20:03,489 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 13:20:03,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 13:20:03,495 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-07 13:20:03,496 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-07 13:20:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:20:03,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-07 13:20:03,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 13:20:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-07 13:20:04,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 13:20:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-07 13:20:04,742 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 13:20:04,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549181881] [2021-11-07 13:20:04,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549181881] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 13:20:04,742 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 13:20:04,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-11-07 13:20:04,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728883499] [2021-11-07 13:20:04,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-07 13:20:04,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 13:20:04,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 13:20:04,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 13:20:04,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-07 13:20:04,745 INFO L87 Difference]: Start difference. First operand 445 states and 629 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:05,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:20:05,011 INFO L93 Difference]: Finished difference Result 883 states and 1253 transitions. [2021-11-07 13:20:05,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-07 13:20:05,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-07 13:20:05,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:20:05,023 INFO L225 Difference]: With dead ends: 883 [2021-11-07 13:20:05,026 INFO L226 Difference]: Without dead ends: 449 [2021-11-07 13:20:05,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 517.86ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-07 13:20:05,033 INFO L933 BasicCegarLoop]: 623 mSDtfsCounter, 0 mSDsluCounter, 1857 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 192.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2480 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.85ms SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 221.95ms IncrementalHoareTripleChecker+Time [2021-11-07 13:20:05,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2480 Invalid, 42 Unknown, 0 Unchecked, 16.85ms Time], IncrementalHoareTripleChecker [14 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 221.95ms Time] [2021-11-07 13:20:05,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-11-07 13:20:05,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2021-11-07 13:20:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.4129464285714286) internal successors, (633), 448 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 633 transitions. [2021-11-07 13:20:05,077 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 633 transitions. Word has length 25 [2021-11-07 13:20:05,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:20:05,078 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 633 transitions. [2021-11-07 13:20:05,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:05,078 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 633 transitions. [2021-11-07 13:20:05,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 13:20:05,080 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:20:05,081 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:20:05,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-07 13:20:05,295 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-07 13:20:05,296 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:20:05,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:20:05,297 INFO L85 PathProgramCache]: Analyzing trace with hash -71275413, now seen corresponding path program 2 times [2021-11-07 13:20:05,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 13:20:05,298 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696803563] [2021-11-07 13:20:05,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 13:20:05,298 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 13:20:05,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 13:20:05,299 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-07 13:20:05,301 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-07 13:20:05,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-07 13:20:05,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 13:20:05,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 13:20:05,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 13:20:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-07 13:20:05,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 13:20:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-07 13:20:05,939 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 13:20:05,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696803563] [2021-11-07 13:20:05,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696803563] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 13:20:05,940 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:20:05,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-07 13:20:05,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316675373] [2021-11-07 13:20:05,940 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 13:20:05,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 13:20:05,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 13:20:05,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 13:20:05,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 13:20:05,941 INFO L87 Difference]: Start difference. First operand 449 states and 633 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:08,004 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 13:20:08,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:20:08,228 INFO L93 Difference]: Finished difference Result 1671 states and 2389 transitions. [2021-11-07 13:20:08,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 13:20:08,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-07 13:20:08,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:20:08,234 INFO L225 Difference]: With dead ends: 1671 [2021-11-07 13:20:08,235 INFO L226 Difference]: Without dead ends: 1242 [2021-11-07 13:20:08,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.38ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 13:20:08,239 INFO L933 BasicCegarLoop]: 622 mSDtfsCounter, 1144 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2188.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 2390 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.95ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2233.05ms IncrementalHoareTripleChecker+Time [2021-11-07 13:20:08,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1144 Valid, 2390 Invalid, 30 Unknown, 0 Unchecked, 4.95ms Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 2233.05ms Time] [2021-11-07 13:20:08,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2021-11-07 13:20:08,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1242. [2021-11-07 13:20:08,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1242 states, 1241 states have (on average 1.4302981466559226) internal successors, (1775), 1241 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1775 transitions. [2021-11-07 13:20:08,287 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1775 transitions. Word has length 29 [2021-11-07 13:20:08,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:20:08,287 INFO L470 AbstractCegarLoop]: Abstraction has 1242 states and 1775 transitions. [2021-11-07 13:20:08,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:08,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1775 transitions. [2021-11-07 13:20:08,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-07 13:20:08,293 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:20:08,293 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 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-07 13:20:08,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-07 13:20:08,508 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-07 13:20:08,508 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:20:08,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:20:08,509 INFO L85 PathProgramCache]: Analyzing trace with hash 354616610, now seen corresponding path program 1 times [2021-11-07 13:20:08,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 13:20:08,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194557291] [2021-11-07 13:20:08,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:20:08,510 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 13:20:08,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 13:20:08,511 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-07 13:20:08,513 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-07 13:20:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:20:08,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-07 13:20:08,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 13:20:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-07 13:20:09,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 13:20:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-07 13:20:09,755 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 13:20:09,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194557291] [2021-11-07 13:20:09,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194557291] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 13:20:09,755 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:20:09,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2021-11-07 13:20:09,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722497496] [2021-11-07 13:20:09,756 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 13:20:09,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 13:20:09,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 13:20:09,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 13:20:09,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-07 13:20:09,757 INFO L87 Difference]: Start difference. First operand 1242 states and 1775 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:10,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:20:10,503 INFO L93 Difference]: Finished difference Result 3684 states and 5278 transitions. [2021-11-07 13:20:10,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 13:20:10,504 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-11-07 13:20:10,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:20:10,513 INFO L225 Difference]: With dead ends: 3684 [2021-11-07 13:20:10,514 INFO L226 Difference]: Without dead ends: 2457 [2021-11-07 13:20:10,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 288.83ms TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-11-07 13:20:10,517 INFO L933 BasicCegarLoop]: 615 mSDtfsCounter, 593 mSDsluCounter, 2436 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 497.63ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 3051 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.78ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 554.83ms IncrementalHoareTripleChecker+Time [2021-11-07 13:20:10,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [593 Valid, 3051 Invalid, 80 Unknown, 0 Unchecked, 4.78ms Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 554.83ms Time] [2021-11-07 13:20:10,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2021-11-07 13:20:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2457. [2021-11-07 13:20:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2457 states, 2456 states have (on average 1.4275244299674268) internal successors, (3506), 2456 states have internal predecessors, (3506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:10,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 3506 transitions. [2021-11-07 13:20:10,593 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 3506 transitions. Word has length 36 [2021-11-07 13:20:10,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:20:10,593 INFO L470 AbstractCegarLoop]: Abstraction has 2457 states and 3506 transitions. [2021-11-07 13:20:10,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:10,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 3506 transitions. [2021-11-07 13:20:10,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-07 13:20:10,598 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:20:10,603 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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] [2021-11-07 13:20:10,627 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-07 13:20:10,817 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-07 13:20:10,817 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:20:10,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:20:10,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1382112580, now seen corresponding path program 1 times [2021-11-07 13:20:10,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 13:20:10,819 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1350093613] [2021-11-07 13:20:10,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:20:10,819 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 13:20:10,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 13:20:10,820 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-07 13:20:10,822 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-07 13:20:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:20:11,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 13:20:11,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 13:20:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-07 13:20:11,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 13:20:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-07 13:20:11,828 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 13:20:11,828 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1350093613] [2021-11-07 13:20:11,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1350093613] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 13:20:11,828 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:20:11,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-07 13:20:11,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77377404] [2021-11-07 13:20:11,828 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 13:20:11,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 13:20:11,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 13:20:11,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 13:20:11,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:20:11,830 INFO L87 Difference]: Start difference. First operand 2457 states and 3506 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:12,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:20:12,145 INFO L93 Difference]: Finished difference Result 5151 states and 7391 transitions. [2021-11-07 13:20:12,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 13:20:12,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-11-07 13:20:12,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:20:12,156 INFO L225 Difference]: With dead ends: 5151 [2021-11-07 13:20:12,156 INFO L226 Difference]: Without dead ends: 2714 [2021-11-07 13:20:12,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.24ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:20:12,161 INFO L933 BasicCegarLoop]: 634 mSDtfsCounter, 90 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 225.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.82ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 254.94ms IncrementalHoareTripleChecker+Time [2021-11-07 13:20:12,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 1223 Invalid, 23 Unknown, 0 Unchecked, 1.82ms Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 254.94ms Time] [2021-11-07 13:20:12,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2021-11-07 13:20:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2669. [2021-11-07 13:20:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2669 states, 2668 states have (on average 1.4374062968515742) internal successors, (3835), 2668 states have internal predecessors, (3835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:12,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 3835 transitions. [2021-11-07 13:20:12,230 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 3835 transitions. Word has length 58 [2021-11-07 13:20:12,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:20:12,232 INFO L470 AbstractCegarLoop]: Abstraction has 2669 states and 3835 transitions. [2021-11-07 13:20:12,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:12,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 3835 transitions. [2021-11-07 13:20:12,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-07 13:20:12,235 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:20:12,235 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:20:12,257 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-07 13:20:12,454 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-07 13:20:12,454 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:20:12,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:20:12,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1249517548, now seen corresponding path program 1 times [2021-11-07 13:20:12,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 13:20:12,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402544100] [2021-11-07 13:20:12,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:20:12,456 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 13:20:12,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 13:20:12,459 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-07 13:20:12,460 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-07 13:20:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:20:12,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 13:20:12,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 13:20:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-07 13:20:13,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 13:20:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-07 13:20:13,644 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 13:20:13,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402544100] [2021-11-07 13:20:13,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402544100] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 13:20:13,645 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:20:13,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-11-07 13:20:13,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003776319] [2021-11-07 13:20:13,645 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 13:20:13,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 13:20:13,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 13:20:13,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 13:20:13,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:20:13,646 INFO L87 Difference]: Start difference. First operand 2669 states and 3835 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:15,745 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-07 13:20:16,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:20:16,065 INFO L93 Difference]: Finished difference Result 5647 states and 8181 transitions. [2021-11-07 13:20:16,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 13:20:16,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-07 13:20:16,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:20:16,077 INFO L225 Difference]: With dead ends: 5647 [2021-11-07 13:20:16,077 INFO L226 Difference]: Without dead ends: 2998 [2021-11-07 13:20:16,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.67ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 13:20:16,082 INFO L933 BasicCegarLoop]: 689 mSDtfsCounter, 440 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2286.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.10ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2328.07ms IncrementalHoareTripleChecker+Time [2021-11-07 13:20:16,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [440 Valid, 935 Invalid, 35 Unknown, 0 Unchecked, 2.10ms Time], IncrementalHoareTripleChecker [12 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 2328.07ms Time] [2021-11-07 13:20:16,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2021-11-07 13:20:16,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2991. [2021-11-07 13:20:16,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2991 states, 2990 states have (on average 1.4451505016722408) internal successors, (4321), 2990 states have internal predecessors, (4321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2991 states to 2991 states and 4321 transitions. [2021-11-07 13:20:16,165 INFO L78 Accepts]: Start accepts. Automaton has 2991 states and 4321 transitions. Word has length 72 [2021-11-07 13:20:16,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:20:16,165 INFO L470 AbstractCegarLoop]: Abstraction has 2991 states and 4321 transitions. [2021-11-07 13:20:16,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2991 states and 4321 transitions. [2021-11-07 13:20:16,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-07 13:20:16,169 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:20:16,169 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:20:16,192 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-07 13:20:16,383 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-07 13:20:16,384 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:20:16,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:20:16,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1797171986, now seen corresponding path program 1 times [2021-11-07 13:20:16,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 13:20:16,385 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520478203] [2021-11-07 13:20:16,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:20:16,385 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 13:20:16,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 13:20:16,386 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-07 13:20:16,388 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-07 13:20:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:20:16,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 7 conjunts are in the unsatisfiable core [2021-11-07 13:20:16,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 13:20:17,189 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-07 13:20:17,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 13:20:17,459 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-07 13:20:17,460 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 13:20:17,460 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520478203] [2021-11-07 13:20:17,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520478203] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 13:20:17,460 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:20:17,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-11-07 13:20:17,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596141517] [2021-11-07 13:20:17,460 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 13:20:17,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 13:20:17,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 13:20:17,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 13:20:17,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 13:20:17,461 INFO L87 Difference]: Start difference. First operand 2991 states and 4321 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:18,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:20:18,409 INFO L93 Difference]: Finished difference Result 13473 states and 19609 transitions. [2021-11-07 13:20:18,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 13:20:18,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-11-07 13:20:18,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:20:18,451 INFO L225 Difference]: With dead ends: 13473 [2021-11-07 13:20:18,452 INFO L226 Difference]: Without dead ends: 10502 [2021-11-07 13:20:18,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 171.09ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 13:20:18,459 INFO L933 BasicCegarLoop]: 1040 mSDtfsCounter, 1591 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 528.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 18.92ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 587.16ms IncrementalHoareTripleChecker+Time [2021-11-07 13:20:18,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1591 Valid, 2648 Invalid, 101 Unknown, 0 Unchecked, 18.92ms Time], IncrementalHoareTripleChecker [20 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 587.16ms Time] [2021-11-07 13:20:18,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10502 states. [2021-11-07 13:20:18,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10502 to 3039. [2021-11-07 13:20:18,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3039 states, 3038 states have (on average 1.4381171823568137) internal successors, (4369), 3038 states have internal predecessors, (4369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:18,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3039 states to 3039 states and 4369 transitions. [2021-11-07 13:20:18,683 INFO L78 Accepts]: Start accepts. Automaton has 3039 states and 4369 transitions. Word has length 72 [2021-11-07 13:20:18,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:20:18,683 INFO L470 AbstractCegarLoop]: Abstraction has 3039 states and 4369 transitions. [2021-11-07 13:20:18,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:18,683 INFO L276 IsEmpty]: Start isEmpty. Operand 3039 states and 4369 transitions. [2021-11-07 13:20:18,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-11-07 13:20:18,686 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:20:18,686 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:20:18,704 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-07 13:20:18,899 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-07 13:20:18,900 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:20:18,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:20:18,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1074123766, now seen corresponding path program 1 times [2021-11-07 13:20:18,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 13:20:18,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538551228] [2021-11-07 13:20:18,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:20:18,901 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 13:20:18,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 13:20:18,902 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-07 13:20:18,903 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-07 13:20:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:20:19,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-07 13:20:19,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 13:20:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-07 13:20:19,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 13:20:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-07 13:20:20,108 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 13:20:20,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538551228] [2021-11-07 13:20:20,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538551228] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 13:20:20,109 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:20:20,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2021-11-07 13:20:20,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849339928] [2021-11-07 13:20:20,109 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 13:20:20,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-07 13:20:20,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 13:20:20,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-07 13:20:20,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-11-07 13:20:20,110 INFO L87 Difference]: Start difference. First operand 3039 states and 4369 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:23,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:20:23,366 INFO L93 Difference]: Finished difference Result 13017 states and 18949 transitions. [2021-11-07 13:20:23,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-07 13:20:23,367 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-11-07 13:20:23,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:20:23,400 INFO L225 Difference]: With dead ends: 13017 [2021-11-07 13:20:23,401 INFO L226 Difference]: Without dead ends: 9998 [2021-11-07 13:20:23,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 859.58ms TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-11-07 13:20:23,407 INFO L933 BasicCegarLoop]: 1515 mSDtfsCounter, 4567 mSDsluCounter, 5772 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2060.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 4567 SdHoareTripleChecker+Valid, 7287 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.87ms SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2235.40ms IncrementalHoareTripleChecker+Time [2021-11-07 13:20:23,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4567 Valid, 7287 Invalid, 383 Unknown, 0 Unchecked, 13.87ms Time], IncrementalHoareTripleChecker [40 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 2235.40ms Time] [2021-11-07 13:20:23,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9998 states. [2021-11-07 13:20:23,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9998 to 3087. [2021-11-07 13:20:23,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3087 states, 3086 states have (on average 1.4235255994815295) internal successors, (4393), 3086 states have internal predecessors, (4393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 3087 states and 4393 transitions. [2021-11-07 13:20:23,624 INFO L78 Accepts]: Start accepts. Automaton has 3087 states and 4393 transitions. Word has length 75 [2021-11-07 13:20:23,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:20:23,625 INFO L470 AbstractCegarLoop]: Abstraction has 3087 states and 4393 transitions. [2021-11-07 13:20:23,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:23,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3087 states and 4393 transitions. [2021-11-07 13:20:23,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-11-07 13:20:23,628 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:20:23,628 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:20:23,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-11-07 13:20:23,847 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-07 13:20:23,847 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:20:23,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:20:23,848 INFO L85 PathProgramCache]: Analyzing trace with hash 21460015, now seen corresponding path program 1 times [2021-11-07 13:20:23,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 13:20:23,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680559568] [2021-11-07 13:20:23,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:20:23,849 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 13:20:23,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 13:20:23,850 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-07 13:20:23,851 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-07 13:20:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:20:24,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-07 13:20:24,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 13:20:25,375 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-07 13:20:25,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 13:20:26,868 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-11-07 13:20:26,868 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 13:20:26,868 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680559568] [2021-11-07 13:20:26,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680559568] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 13:20:26,868 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:20:26,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 18 [2021-11-07 13:20:26,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530335199] [2021-11-07 13:20:26,869 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-07 13:20:26,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-07 13:20:26,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 13:20:26,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-07 13:20:26,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-11-07 13:20:26,870 INFO L87 Difference]: Start difference. First operand 3087 states and 4393 transitions. Second operand has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:41,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 13:20:41,652 INFO L93 Difference]: Finished difference Result 21817 states and 31701 transitions. [2021-11-07 13:20:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-07 13:20:41,653 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-11-07 13:20:41,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 13:20:41,690 INFO L225 Difference]: With dead ends: 21817 [2021-11-07 13:20:41,690 INFO L226 Difference]: Without dead ends: 18750 [2021-11-07 13:20:41,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 6357.69ms TimeCoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2021-11-07 13:20:41,698 INFO L933 BasicCegarLoop]: 2001 mSDtfsCounter, 13227 mSDsluCounter, 22690 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8341.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13227 SdHoareTripleChecker+Valid, 24691 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 34.89ms SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9090.15ms IncrementalHoareTripleChecker+Time [2021-11-07 13:20:41,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13227 Valid, 24691 Invalid, 1459 Unknown, 0 Unchecked, 34.89ms Time], IncrementalHoareTripleChecker [52 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 9090.15ms Time] [2021-11-07 13:20:41,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18750 states. [2021-11-07 13:20:42,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18750 to 3255. [2021-11-07 13:20:42,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3255 states, 3254 states have (on average 1.4090350338045483) internal successors, (4585), 3254 states have internal predecessors, (4585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4585 transitions. [2021-11-07 13:20:42,096 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4585 transitions. Word has length 77 [2021-11-07 13:20:42,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 13:20:42,097 INFO L470 AbstractCegarLoop]: Abstraction has 3255 states and 4585 transitions. [2021-11-07 13:20:42,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.777777777777778) internal successors, (86), 18 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 13:20:42,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4585 transitions. [2021-11-07 13:20:42,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-11-07 13:20:42,100 INFO L506 BasicCegarLoop]: Found error trace [2021-11-07 13:20:42,101 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:20:42,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-11-07 13:20:42,318 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-07 13:20:42,318 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 13:20:42,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 13:20:42,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1164854511, now seen corresponding path program 1 times [2021-11-07 13:20:42,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 13:20:42,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265954867] [2021-11-07 13:20:42,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:20:42,320 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 13:20:42,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-11-07 13:20:42,321 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-07 13:20:42,322 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-07 13:20:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:20:43,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 31 conjunts are in the unsatisfiable core [2021-11-07 13:20:43,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 13:20:44,246 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-07 13:20:51,100 INFO L354 Elim1Store]: treesize reduction 20, result has 31.0 percent of original size [2021-11-07 13:20:51,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2021-11-07 13:21:07,600 INFO L354 Elim1Store]: treesize reduction 74, result has 23.7 percent of original size [2021-11-07 13:21:07,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 67 [2021-11-07 13:21:07,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 1 [2021-11-07 13:21:18,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2021-11-07 13:21:18,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2021-11-07 13:21:42,415 INFO L354 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2021-11-07 13:21:42,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 66 [2021-11-07 13:22:10,714 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-07 13:22:10,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 84 [2021-11-07 13:22:10,727 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-07 13:22:10,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2021-11-07 13:22:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-07 13:22:11,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 13:22:30,098 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_skb_put_~arg0.offset_9 (_ BitVec 64)) (v_ULTIMATE.start_skb_put_~arg1_9 (_ BitVec 32))) (bvult (_ bv0 64) (let ((.cse0 (select (store |c_#memory_int| c_ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.base (let ((.cse1 (select |c_#memory_int| c_ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.base)) (.cse2 (bvadd (_ bv216 64) v_ULTIMATE.start_skb_put_~arg0.offset_9))) (store .cse1 .cse2 (bvadd (select .cse1 .cse2) v_ULTIMATE.start_skb_put_~arg1_9)))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base))) (concat (select .cse0 (bvadd (_ bv464 64) c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) (select .cse0 (bvadd c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset (_ bv460 64))))))) is different from false [2021-11-07 13:22:32,155 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg0.offset_9 (_ BitVec 64)) (v_ULTIMATE.start_skb_put_~arg1_9 (_ BitVec 32)) (ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset (_ BitVec 64))) (bvult (_ bv0 64) (let ((.cse0 (select (store |c_#memory_int| c_ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.base (let ((.cse1 (store (store (select |c_#memory_int| c_ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.base) (bvadd (_ bv224 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_5) (bvadd (_ bv232 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_4)) (.cse2 (bvadd (_ bv216 64) v_ULTIMATE.start_skb_put_~arg0.offset_9))) (store .cse1 .cse2 (bvadd (select .cse1 .cse2) v_ULTIMATE.start_skb_put_~arg1_9)))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base))) (concat (select .cse0 (bvadd (_ bv464 64) c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) (select .cse0 (bvadd c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset (_ bv460 64))))))) is different from false [2021-11-07 13:22:34,256 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg0.offset_9 (_ BitVec 64)) (v_ULTIMATE.start_skb_put_~arg1_9 (_ BitVec 32)) (ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset (_ BitVec 64))) (bvult (_ bv0 64) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_ldv_skb_alloc_#res.base| (let ((.cse1 (store (store (select |c_#memory_int| |c_ULTIMATE.start_ldv_skb_alloc_#res.base|) (bvadd (_ bv224 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_5) (bvadd (_ bv232 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_4)) (.cse2 (bvadd (_ bv216 64) v_ULTIMATE.start_skb_put_~arg0.offset_9))) (store .cse1 .cse2 (bvadd (select .cse1 .cse2) v_ULTIMATE.start_skb_put_~arg1_9)))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base))) (concat (select .cse0 (bvadd (_ bv464 64) c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) (select .cse0 (bvadd c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset (_ bv460 64))))))) is different from false [2021-11-07 13:22:36,306 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg0.offset_9 (_ BitVec 64)) (v_ULTIMATE.start_skb_put_~arg1_9 (_ BitVec 32)) (ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset (_ BitVec 64))) (bvult (_ bv0 64) (let ((.cse0 (select (store |c_#memory_int| c_ULTIMATE.start_ldv_skb_alloc_~skb~0.base (let ((.cse1 (store (store (select |c_#memory_int| c_ULTIMATE.start_ldv_skb_alloc_~skb~0.base) (bvadd (_ bv224 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_5) (bvadd (_ bv232 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_4)) (.cse2 (bvadd (_ bv216 64) v_ULTIMATE.start_skb_put_~arg0.offset_9))) (store .cse1 .cse2 (bvadd (select .cse1 .cse2) v_ULTIMATE.start_skb_put_~arg1_9)))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base))) (concat (select .cse0 (bvadd (_ bv464 64) c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) (select .cse0 (bvadd c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset (_ bv460 64))))))) is different from false [2021-11-07 13:22:56,619 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg0.offset_9 (_ BitVec 64)) (~last_index~0 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg1_9 (_ BitVec 32)) (ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset (_ BitVec 64)) (|~#set_impl~0.offset| (_ BitVec 64))) (bvult (_ bv0 64) (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_~#set_impl~0.base| (store (select |c_#memory_int| |c_~#set_impl~0.base|) (bvadd |~#set_impl~0.offset| (bvmul ((_ sign_extend 32) ~last_index~0) (_ bv8 64))) v_DerPreprocessor_6)))) (store .cse1 |c_ULTIMATE.start_ldv_zalloc_#res.base| (let ((.cse2 (store (store (select .cse1 |c_ULTIMATE.start_ldv_zalloc_#res.base|) (bvadd (_ bv224 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_5) (bvadd (_ bv232 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_4)) (.cse3 (bvadd (_ bv216 64) v_ULTIMATE.start_skb_put_~arg0.offset_9))) (store .cse2 .cse3 (bvadd (select .cse2 .cse3) v_ULTIMATE.start_skb_put_~arg1_9))))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base))) (concat (select .cse0 (bvadd (_ bv464 64) c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) (select .cse0 (bvadd c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset (_ bv460 64))))))) is different from false [2021-11-07 13:22:58,696 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg0.offset_9 (_ BitVec 64)) (~last_index~0 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg1_9 (_ BitVec 32)) (ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset (_ BitVec 64)) (|~#set_impl~0.offset| (_ BitVec 64))) (bvult (_ bv0 64) (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_~#set_impl~0.base| (store (select |c_#memory_int| |c_~#set_impl~0.base|) (bvadd |~#set_impl~0.offset| (bvmul ((_ sign_extend 32) ~last_index~0) (_ bv8 64))) v_DerPreprocessor_6)))) (store .cse1 c_ULTIMATE.start_ldv_zalloc_~p~1.base (let ((.cse2 (store (store (select .cse1 c_ULTIMATE.start_ldv_zalloc_~p~1.base) (bvadd (_ bv224 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_5) (bvadd (_ bv232 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_4)) (.cse3 (bvadd (_ bv216 64) v_ULTIMATE.start_skb_put_~arg0.offset_9))) (store .cse2 .cse3 (bvadd (select .cse2 .cse3) v_ULTIMATE.start_skb_put_~arg1_9))))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base))) (concat (select .cse0 (bvadd (_ bv464 64) c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) (select .cse0 (bvadd c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset (_ bv460 64))))))) is different from false [2021-11-07 13:23:24,256 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg0.offset_9 (_ BitVec 64)) (~last_index~0 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg1_9 (_ BitVec 32)) (ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset (_ BitVec 64)) (|~#set_impl~0.offset| (_ BitVec 64)) (|v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37| (_ BitVec 64))) (or (= (_ bv0 64) |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37|) (bvult (_ bv0 64) (let ((.cse0 (select (let ((.cse1 (let ((.cse4 (store |c_#memory_int| |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37| ((as const (Array (_ BitVec 64) (_ BitVec 32))) (_ bv0 32))))) (store .cse4 |c_~#set_impl~0.base| (store (select .cse4 |c_~#set_impl~0.base|) (bvadd |~#set_impl~0.offset| (bvmul ((_ sign_extend 32) ~last_index~0) (_ bv8 64))) v_DerPreprocessor_6))))) (store .cse1 |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37| (let ((.cse2 (store (store (select .cse1 |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37|) (bvadd (_ bv224 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_5) (bvadd (_ bv232 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_4)) (.cse3 (bvadd (_ bv216 64) v_ULTIMATE.start_skb_put_~arg0.offset_9))) (store .cse2 .cse3 (bvadd (select .cse2 .cse3) v_ULTIMATE.start_skb_put_~arg1_9))))) c_ULTIMATE.start_cx82310_rx_fixup_~dev.base))) (concat (select .cse0 (bvadd (_ bv464 64) c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset)) (select .cse0 (bvadd c_ULTIMATE.start_cx82310_rx_fixup_~dev.offset (_ bv460 64)))))))) is different from false [2021-11-07 13:23:32,470 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg0.offset_9 (_ BitVec 64)) (v_ULTIMATE.start_cx82310_rx_fixup_~dev.offset_25 (_ BitVec 64)) (~last_index~0 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg1_9 (_ BitVec 32)) (ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset (_ BitVec 64)) (|~#set_impl~0.offset| (_ BitVec 64)) (|v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37| (_ BitVec 64))) (let ((.cse1 (bvadd (_ bv464 64) v_ULTIMATE.start_cx82310_rx_fixup_~dev.offset_25)) (.cse2 (bvadd (_ bv460 64) v_ULTIMATE.start_cx82310_rx_fixup_~dev.offset_25))) (or (= (_ bv0 64) (let ((.cse0 (select |c_#memory_int| c_~cx82310_info_group0~0.base))) (concat (select .cse0 .cse1) (select .cse0 .cse2)))) (= (_ bv0 64) |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37|) (bvult (_ bv0 64) (let ((.cse3 (select (let ((.cse4 (let ((.cse7 (store |c_#memory_int| |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37| ((as const (Array (_ BitVec 64) (_ BitVec 32))) (_ bv0 32))))) (store .cse7 |c_~#set_impl~0.base| (store (select .cse7 |c_~#set_impl~0.base|) (bvadd |~#set_impl~0.offset| (bvmul ((_ sign_extend 32) ~last_index~0) (_ bv8 64))) v_DerPreprocessor_6))))) (store .cse4 |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37| (let ((.cse5 (store (store (select .cse4 |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37|) (bvadd (_ bv224 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_5) (bvadd (_ bv232 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_4)) (.cse6 (bvadd (_ bv216 64) v_ULTIMATE.start_skb_put_~arg0.offset_9))) (store .cse5 .cse6 (bvadd (select .cse5 .cse6) v_ULTIMATE.start_skb_put_~arg1_9))))) c_~cx82310_info_group0~0.base))) (concat (select .cse3 .cse1) (select .cse3 .cse2))))))) is different from false [2021-11-07 13:23:42,898 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg0.offset_9 (_ BitVec 64)) (v_ULTIMATE.start_cx82310_rx_fixup_~dev.offset_25 (_ BitVec 64)) (~last_index~0 (_ BitVec 32)) (v_ULTIMATE.start_skb_put_~arg1_9 (_ BitVec 32)) (ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset (_ BitVec 64)) (|~#set_impl~0.offset| (_ BitVec 64)) (|v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37| (_ BitVec 64))) (let ((.cse1 (bvadd (_ bv464 64) v_ULTIMATE.start_cx82310_rx_fixup_~dev.offset_25)) (.cse2 (bvadd (_ bv460 64) v_ULTIMATE.start_cx82310_rx_fixup_~dev.offset_25))) (or (bvult (_ bv0 64) (let ((.cse0 (select (let ((.cse3 (let ((.cse6 (store |c_#memory_int| |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37| ((as const (Array (_ BitVec 64) (_ BitVec 32))) (_ bv0 32))))) (store .cse6 |c_~#set_impl~0.base| (store (select .cse6 |c_~#set_impl~0.base|) (bvadd |~#set_impl~0.offset| (bvmul ((_ sign_extend 32) ~last_index~0) (_ bv8 64))) v_DerPreprocessor_6))))) (store .cse3 |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37| (let ((.cse4 (store (store (select .cse3 |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37|) (bvadd (_ bv224 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_5) (bvadd (_ bv232 64) ULTIMATE.start_ldv_alloc_skb_12_~tmp~12.offset) v_DerPreprocessor_4)) (.cse5 (bvadd (_ bv216 64) v_ULTIMATE.start_skb_put_~arg0.offset_9))) (store .cse4 .cse5 (bvadd (select .cse4 .cse5) v_ULTIMATE.start_skb_put_~arg1_9))))) |c_ULTIMATE.start_ldv_zalloc_#res.base|))) (concat (select .cse0 .cse1) (select .cse0 .cse2)))) (= (_ bv0 64) |v_ULTIMATE.start_ldv_zalloc_#t~malloc35.base_37|) (= (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_ldv_zalloc_#res.base|))) (concat (select .cse7 .cse1) (select .cse7 .cse2))) (_ bv0 64))))) is different from false [2021-11-07 13:24:08,227 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 13:24:08,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265954867] [2021-11-07 13:24:08,227 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Index 1 out of bounds for length 1 [2021-11-07 13:24:08,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1505119470] [2021-11-07 13:24:08,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:24:08,228 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-07 13:24:08,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-11-07 13:24:08,229 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-07 13:24:08,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2021-11-07 13:24:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:24:09,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-07 13:24:09,107 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@3dc778b2 [2021-11-07 13:24:09,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772089446] [2021-11-07 13:24:09,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 13:24:09,107 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 13:24:09,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-07 13:24:09,109 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 13:24:09,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-07 13:24:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 13:24:09,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-07 13:24:09,532 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@3dc778b2 [2021-11-07 13:24:09,532 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-11-07 13:24:09,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-11-07 13:24:09,532 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-11-07 13:24:09,532 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-11-07 13:24:09,538 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-07 13:24:09,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-07 13:24:09,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-11-07 13:24:09,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2021-11-07 13:24:10,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-11-07 13:24:10,142 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 13:24:10,144 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 13:24:10,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:24:10 BoogieIcfgContainer [2021-11-07 13:24:10,173 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 13:24:10,173 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 13:24:10,173 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 13:24:10,174 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 13:24:10,174 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:20:02" (3/4) ... [2021-11-07 13:24:10,176 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-07 13:24:10,176 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 13:24:10,176 INFO L158 Benchmark]: Toolchain (without parser) took 261818.45ms. Allocated memory was 54.5MB in the beginning and 375.4MB in the end (delta: 320.9MB). Free memory was 34.7MB in the beginning and 95.1MB in the end (delta: -60.4MB). Peak memory consumption was 259.7MB. Max. memory is 16.1GB. [2021-11-07 13:24:10,176 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory was 36.8MB in the beginning and 36.8MB in the end (delta: 36.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-07 13:24:10,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1107.30ms. Allocated memory was 54.5MB in the beginning and 102.8MB in the end (delta: 48.2MB). Free memory was 34.6MB in the beginning and 55.9MB in the end (delta: -21.4MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2021-11-07 13:24:10,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 131.44ms. Allocated memory is still 102.8MB. Free memory was 55.9MB in the beginning and 42.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-07 13:24:10,177 INFO L158 Benchmark]: Boogie Preprocessor took 178.25ms. Allocated memory is still 102.8MB. Free memory was 42.9MB in the beginning and 45.0MB in the end (delta: -2.1MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2021-11-07 13:24:10,177 INFO L158 Benchmark]: RCFGBuilder took 12310.87ms. Allocated memory was 102.8MB in the beginning and 232.8MB in the end (delta: 130.0MB). Free memory was 45.0MB in the beginning and 83.9MB in the end (delta: -38.9MB). Peak memory consumption was 138.1MB. Max. memory is 16.1GB. [2021-11-07 13:24:10,178 INFO L158 Benchmark]: TraceAbstraction took 248080.91ms. Allocated memory was 232.8MB in the beginning and 375.4MB in the end (delta: 142.6MB). Free memory was 83.9MB in the beginning and 95.1MB in the end (delta: -11.2MB). Peak memory consumption was 131.4MB. Max. memory is 16.1GB. [2021-11-07 13:24:10,178 INFO L158 Benchmark]: Witness Printer took 2.66ms. Allocated memory is still 375.4MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-07 13:24:10,179 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 54.5MB. Free memory was 36.8MB in the beginning and 36.8MB in the end (delta: 36.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1107.30ms. Allocated memory was 54.5MB in the beginning and 102.8MB in the end (delta: 48.2MB). Free memory was 34.6MB in the beginning and 55.9MB in the end (delta: -21.4MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 131.44ms. Allocated memory is still 102.8MB. Free memory was 55.9MB in the beginning and 42.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 178.25ms. Allocated memory is still 102.8MB. Free memory was 42.9MB in the beginning and 45.0MB in the end (delta: -2.1MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * RCFGBuilder took 12310.87ms. Allocated memory was 102.8MB in the beginning and 232.8MB in the end (delta: 130.0MB). Free memory was 45.0MB in the beginning and 83.9MB in the end (delta: -38.9MB). Peak memory consumption was 138.1MB. Max. memory is 16.1GB. * TraceAbstraction took 248080.91ms. Allocated memory was 232.8MB in the beginning and 375.4MB in the end (delta: 142.6MB). Free memory was 83.9MB in the beginning and 95.1MB in the end (delta: -11.2MB). Peak memory consumption was 131.4MB. Max. memory is 16.1GB. * Witness Printer took 2.66ms. Allocated memory is still 375.4MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms 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 ; [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] tmp = ldv_zalloc(32UL) [L5983] ldvarg1 = (struct usb_device_id *)tmp [L6237] set = set_impl [L6238] last_index = 0 [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 [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 ; [L6487] return __VERIFIER_nondet_int(); [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 [L5964] void *tmp ; [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] tmp = ldv_zalloc(1560UL) [L5967] cx82310_driver_group1 = (struct usb_interface *)tmp [L6219] return (ldv_func_res); [L5927] tmp = ldv_usb_register_driver_14(& cx82310_driver, & __this_module, "cx82310_eth") [L5928] return (tmp); [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 [L5949] void *tmp ; [L5950] void *tmp___0 ; [L5951] void *tmp___1 ; [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] tmp = ldv_zalloc(1472UL) [L5954] cx82310_info_group0 = (struct usbnet *)tmp [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] tmp___0 = ldv_zalloc(1560UL) [L5956] cx82310_info_group1 = (struct usb_interface *)tmp___0 [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] tmp___1 = ldv_zalloc(232UL) [L5958] cx82310_info_group2 = (struct sk_buff *)tmp___1 [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 [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 TRUE dev->data[1] != 0UL [L5815] EXPR dev->data[0] [L5815] EXPR dev->data[1] [L5815] len = (int )((unsigned int )dev->data[0] + (unsigned int )dev->data[1]) [L6197] struct sk_buff *tmp ; [L6369] void *skb ; [L6370] void *tmp___7 ; [L5534] void *p ; [L5535] void *tmp ; [L5536] int tmp___0 ; [L5538] tmp___0 = __VERIFIER_nondet_int() [L5539] COND FALSE !(tmp___0 != 0) [L5542] tmp = calloc(1UL, size) [L5543] p = tmp [L5513] COND FALSE !(!cond) [L5545] return (p); [L6372] tmp___7 = ldv_zalloc(sizeof(struct sk_buff___0 )) [L6373] skb = (struct sk_buff___0 *)tmp___7 [L6374] COND FALSE !(! 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 [L6378] return (skb); [L6199] tmp = ldv_skb_alloc() [L6200] COND TRUE \read(*tmp) [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] tmp->head = ldv_malloc(size) [L6203] EXPR tmp->head [L6203] tmp->data = tmp->head [L6205] return (tmp); [L5816] skb2 = ldv_alloc_skb_12((unsigned int )len, 32U) [L5817] COND FALSE !((unsigned long )skb2 == (unsigned long )((struct sk_buff *)0)) [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; [L5822] EXPR dev->data[0] [L5822] __len = dev->data[0] [L5823] EXPR skb2->data [L5823] EXPR dev->data[2] [L5823] __ret = memcpy((void *)skb2->data, (void const *)dev->data[2], __len) [L5824] EXPR dev->data[1] [L5824] __len___0 = dev->data[1] [L5825] EXPR skb2->data [L5825] EXPR dev->data[0] [L5825] EXPR skb->data [L5825-L5826] __ret___0 = memcpy((void *)(skb2->data + dev->data[0]), (void const *)skb->data, __len___0) [L5828] dev->data[1] [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] return ldv_malloc(sizeof(unsigned char)); [L5829] dev->data[1] = 0UL [L5830] EXPR skb->len [L5830] COND TRUE skb->len <= 1U [L5831] return (1); [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 [L6226] ldv_state_variable_1 = 0 [L6067] ldv_state_variable_0 = 2 [L6436] int tmp___7 ; [L6327] return (last_index == 0); [L6438] tmp___7 = ldv_set_is_empty(LDV_SKBS) [L6439] COND FALSE !(\read(tmp___7)) [L5569] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 449 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 248003.21ms, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 41.85ms, AutomataDifference: 25461.44ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 14.32ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 21652 SdHoareTripleChecker+Valid, 17581.18ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21652 mSDsluCounter, 46602 SdHoareTripleChecker+Invalid, 16385.12ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38228 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2009 IncrementalHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 8374 mSDtfsCounter, 2009 mSolverCounterSat, 108.74ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 959 GetRequests, 881 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 8398.06ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3255occurred in iteration=9, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 1183.84ms AutomataMinimizationTime, 9 MinimizatonAttempts, 29921 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 372.34ms SsaConstructionTime, 3234.58ms SatisfiabilityAnalysisTime, 212545.38ms InterpolantComputationTime, 554 NumberOfCodeBlocks, 546 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1000 ConstructedInterpolants, 45 QuantifiedInterpolants, 3185 SizeOfPredicates, 67 NumberOfNonLiveVariables, 4681 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 411/417 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-07 13:24:10,263 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 Writing output log to file Ultimate.log Result: UNKNOWN