./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--wan--hdlc_x25.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15e6fa79-55a5-49d8-a68a-99aa87a6af71/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15e6fa79-55a5-49d8-a68a-99aa87a6af71/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15e6fa79-55a5-49d8-a68a-99aa87a6af71/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15e6fa79-55a5-49d8-a68a-99aa87a6af71/bin/uautomizer-TMbwUNV5ro/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--wan--hdlc_x25.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15e6fa79-55a5-49d8-a68a-99aa87a6af71/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15e6fa79-55a5-49d8-a68a-99aa87a6af71/bin/uautomizer-TMbwUNV5ro --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 9ca2eb28b930065096f039703bc8c545a25de7919cc90a3441476b4fab43b08c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:57:09,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:57:09,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:57:09,414 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:57:09,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:57:09,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:57:09,425 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:57:09,433 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:57:09,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:57:09,437 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:57:09,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:57:09,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:57:09,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:57:09,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:57:09,448 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:57:09,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:57:09,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:57:09,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:57:09,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:57:09,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:57:09,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:57:09,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:57:09,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:57:09,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:57:09,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:57:09,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:57:09,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:57:09,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:57:09,488 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:57:09,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:57:09,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:57:09,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:57:09,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:57:09,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:57:09,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:57:09,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:57:09,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:57:09,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:57:09,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:57:09,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:57:09,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:57:09,515 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15e6fa79-55a5-49d8-a68a-99aa87a6af71/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-18 20:57:09,558 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:57:09,562 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:57:09,563 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:57:09,563 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:57:09,564 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:57:09,564 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:57:09,565 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:57:09,565 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:57:09,566 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:57:09,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:57:09,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:57:09,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:57:09,567 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:57:09,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:57:09,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:57:09,568 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:57:09,568 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:57:09,568 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:57:09,569 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:57:09,569 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:57:09,569 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:57:09,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:57:09,570 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:57:09,570 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:57:09,570 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:57:09,570 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:57:09,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:57:09,572 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:57:09,572 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:57:09,572 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:57:09,573 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15e6fa79-55a5-49d8-a68a-99aa87a6af71/bin/uautomizer-TMbwUNV5ro/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15e6fa79-55a5-49d8-a68a-99aa87a6af71/bin/uautomizer-TMbwUNV5ro 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 -> 9ca2eb28b930065096f039703bc8c545a25de7919cc90a3441476b4fab43b08c [2022-11-18 20:57:09,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:57:09,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:57:09,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:57:09,942 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:57:09,943 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:57:09,944 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15e6fa79-55a5-49d8-a68a-99aa87a6af71/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_x25.ko-entry_point.cil.out.i [2022-11-18 20:57:10,010 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15e6fa79-55a5-49d8-a68a-99aa87a6af71/bin/uautomizer-TMbwUNV5ro/data/5964251a3/279fb79726b3421887b7f811f5227396/FLAGcb1458c63 [2022-11-18 20:57:10,926 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:57:10,926 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15e6fa79-55a5-49d8-a68a-99aa87a6af71/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_x25.ko-entry_point.cil.out.i [2022-11-18 20:57:10,971 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15e6fa79-55a5-49d8-a68a-99aa87a6af71/bin/uautomizer-TMbwUNV5ro/data/5964251a3/279fb79726b3421887b7f811f5227396/FLAGcb1458c63 [2022-11-18 20:57:11,432 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15e6fa79-55a5-49d8-a68a-99aa87a6af71/bin/uautomizer-TMbwUNV5ro/data/5964251a3/279fb79726b3421887b7f811f5227396 [2022-11-18 20:57:11,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:57:11,437 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:57:11,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:57:11,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:57:11,443 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:57:11,444 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:57:11" (1/1) ... [2022-11-18 20:57:11,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@543534f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:11, skipping insertion in model container [2022-11-18 20:57:11,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:57:11" (1/1) ... [2022-11-18 20:57:11,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:57:11,538 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:57:12,369 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15e6fa79-55a5-49d8-a68a-99aa87a6af71/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_x25.ko-entry_point.cil.out.i[152690,152703] [2022-11-18 20:57:12,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:57:12,715 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:57:12,865 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15e6fa79-55a5-49d8-a68a-99aa87a6af71/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_x25.ko-entry_point.cil.out.i[152690,152703] [2022-11-18 20:57:12,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:57:13,016 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:57:13,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:13 WrapperNode [2022-11-18 20:57:13,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:57:13,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:57:13,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:57:13,021 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:57:13,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:13" (1/1) ... [2022-11-18 20:57:13,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:13" (1/1) ... [2022-11-18 20:57:13,142 INFO L138 Inliner]: procedures = 110, calls = 180, calls flagged for inlining = 54, calls inlined = 43, statements flattened = 631 [2022-11-18 20:57:13,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:57:13,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:57:13,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:57:13,152 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:57:13,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:13" (1/1) ... [2022-11-18 20:57:13,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:13" (1/1) ... [2022-11-18 20:57:13,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:13" (1/1) ... [2022-11-18 20:57:13,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:13" (1/1) ... [2022-11-18 20:57:13,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:13" (1/1) ... [2022-11-18 20:57:13,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:13" (1/1) ... [2022-11-18 20:57:13,254 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:13" (1/1) ... [2022-11-18 20:57:13,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:13" (1/1) ... [2022-11-18 20:57:13,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:57:13,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:57:13,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:57:13,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:57:13,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:13" (1/1) ... [2022-11-18 20:57:13,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:57:13,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15e6fa79-55a5-49d8-a68a-99aa87a6af71/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:57:13,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15e6fa79-55a5-49d8-a68a-99aa87a6af71/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:57:13,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15e6fa79-55a5-49d8-a68a-99aa87a6af71/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:57:13,365 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-18 20:57:13,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-18 20:57:13,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:57:13,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-18 20:57:13,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-18 20:57:13,366 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-11-18 20:57:13,366 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-11-18 20:57:13,366 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-11-18 20:57:13,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-11-18 20:57:13,366 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-18 20:57:13,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-18 20:57:13,367 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-11-18 20:57:13,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-11-18 20:57:13,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:57:13,367 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-18 20:57:13,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-18 20:57:13,367 INFO L130 BoogieDeclarations]: Found specification of procedure x25_ioctl [2022-11-18 20:57:13,368 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_ioctl [2022-11-18 20:57:13,368 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-11-18 20:57:13,368 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-11-18 20:57:13,368 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-18 20:57:13,368 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-18 20:57:13,368 INFO L130 BoogieDeclarations]: Found specification of procedure x25_connect_disconnect [2022-11-18 20:57:13,369 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_connect_disconnect [2022-11-18 20:57:13,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:57:13,369 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-11-18 20:57:13,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-11-18 20:57:13,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:57:13,369 INFO L130 BoogieDeclarations]: Found specification of procedure x25_type_trans [2022-11-18 20:57:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_type_trans [2022-11-18 20:57:13,370 INFO L130 BoogieDeclarations]: Found specification of procedure x25_xmit [2022-11-18 20:57:13,370 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_xmit [2022-11-18 20:57:13,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:57:13,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:57:13,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:57:13,371 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-11-18 20:57:13,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-11-18 20:57:13,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:57:13,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:57:13,372 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_zalloc [2022-11-18 20:57:13,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_zalloc [2022-11-18 20:57:13,372 INFO L130 BoogieDeclarations]: Found specification of procedure x25_rx [2022-11-18 20:57:13,372 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_rx [2022-11-18 20:57:13,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:57:13,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:57:13,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:57:13,753 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:57:13,760 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:57:14,152 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-18 20:57:14,523 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:57:14,537 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:57:14,545 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-18 20:57:14,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:57:14 BoogieIcfgContainer [2022-11-18 20:57:14,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:57:14,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:57:14,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:57:14,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:57:14,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:57:11" (1/3) ... [2022-11-18 20:57:14,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d59cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:57:14, skipping insertion in model container [2022-11-18 20:57:14,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:13" (2/3) ... [2022-11-18 20:57:14,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d59cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:57:14, skipping insertion in model container [2022-11-18 20:57:14,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:57:14" (3/3) ... [2022-11-18 20:57:14,563 INFO L112 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_x25.ko-entry_point.cil.out.i [2022-11-18 20:57:14,597 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:57:14,597 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 20:57:14,686 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:57:14,697 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7cb233f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:57:14,698 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 20:57:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 237 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 190 states have internal predecessors, (254), 35 states have call successors, (35), 17 states have call predecessors, (35), 16 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-11-18 20:57:14,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-18 20:57:14,718 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:14,719 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-11-18 20:57:14,720 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:57:14,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:14,726 INFO L85 PathProgramCache]: Analyzing trace with hash 898254007, now seen corresponding path program 1 times [2022-11-18 20:57:14,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:14,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970762537] [2022-11-18 20:57:14,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:14,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:15,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:15,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:15,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:57:15,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:15,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970762537] [2022-11-18 20:57:15,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970762537] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:15,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:15,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:57:15,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311228978] [2022-11-18 20:57:15,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:15,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:57:15,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:15,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:57:15,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:57:15,381 INFO L87 Difference]: Start difference. First operand has 237 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 190 states have internal predecessors, (254), 35 states have call successors, (35), 17 states have call predecessors, (35), 16 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:57:16,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:16,380 INFO L93 Difference]: Finished difference Result 786 states and 1141 transitions. [2022-11-18 20:57:16,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:57:16,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-11-18 20:57:16,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:16,400 INFO L225 Difference]: With dead ends: 786 [2022-11-18 20:57:16,400 INFO L226 Difference]: Without dead ends: 540 [2022-11-18 20:57:16,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:57:16,419 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 765 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:16,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 638 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-18 20:57:16,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-11-18 20:57:16,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 432. [2022-11-18 20:57:16,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 341 states have (on average 1.3284457478005864) internal successors, (453), 343 states have internal predecessors, (453), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2022-11-18 20:57:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 572 transitions. [2022-11-18 20:57:16,558 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 572 transitions. Word has length 33 [2022-11-18 20:57:16,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:16,559 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 572 transitions. [2022-11-18 20:57:16,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:57:16,559 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 572 transitions. [2022-11-18 20:57:16,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-18 20:57:16,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:16,562 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:57:16,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:57:16,563 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:57:16,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:16,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1941540429, now seen corresponding path program 1 times [2022-11-18 20:57:16,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:16,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360678237] [2022-11-18 20:57:16,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:16,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:16,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:16,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:16,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:16,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:57:16,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:16,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360678237] [2022-11-18 20:57:16,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360678237] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:16,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:16,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:57:16,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902324384] [2022-11-18 20:57:16,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:16,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:57:16,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:16,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:57:16,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:57:16,737 INFO L87 Difference]: Start difference. First operand 432 states and 572 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:57:17,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:17,371 INFO L93 Difference]: Finished difference Result 965 states and 1293 transitions. [2022-11-18 20:57:17,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:57:17,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-11-18 20:57:17,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:17,381 INFO L225 Difference]: With dead ends: 965 [2022-11-18 20:57:17,381 INFO L226 Difference]: Without dead ends: 539 [2022-11-18 20:57:17,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:57:17,389 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 624 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:17,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 686 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:57:17,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-11-18 20:57:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 431. [2022-11-18 20:57:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 340 states have (on average 1.3205882352941176) internal successors, (449), 342 states have internal predecessors, (449), 60 states have call successors, (60), 31 states have call predecessors, (60), 30 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2022-11-18 20:57:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 568 transitions. [2022-11-18 20:57:17,462 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 568 transitions. Word has length 36 [2022-11-18 20:57:17,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:17,463 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 568 transitions. [2022-11-18 20:57:17,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:57:17,463 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 568 transitions. [2022-11-18 20:57:17,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-18 20:57:17,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:17,477 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:57:17,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:57:17,477 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:57:17,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:17,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2029658452, now seen corresponding path program 1 times [2022-11-18 20:57:17,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:17,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147804684] [2022-11-18 20:57:17,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:17,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:17,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:17,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:17,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:17,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:57:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:17,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:17,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:17,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:57:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:17,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:17,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-18 20:57:17,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:17,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147804684] [2022-11-18 20:57:17,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147804684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:17,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:17,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:57:17,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248417568] [2022-11-18 20:57:17,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:17,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:57:17,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:17,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:57:17,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:57:17,966 INFO L87 Difference]: Start difference. First operand 431 states and 568 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:57:19,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:19,042 INFO L93 Difference]: Finished difference Result 1462 states and 2036 transitions. [2022-11-18 20:57:19,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:57:19,043 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 77 [2022-11-18 20:57:19,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:19,053 INFO L225 Difference]: With dead ends: 1462 [2022-11-18 20:57:19,053 INFO L226 Difference]: Without dead ends: 1032 [2022-11-18 20:57:19,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:57:19,059 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 520 mSDsluCounter, 998 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:19,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1246 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-18 20:57:19,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2022-11-18 20:57:19,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 840. [2022-11-18 20:57:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 661 states have (on average 1.3222390317700454) internal successors, (874), 665 states have internal predecessors, (874), 118 states have call successors, (118), 61 states have call predecessors, (118), 60 states have return successors, (145), 117 states have call predecessors, (145), 117 states have call successors, (145) [2022-11-18 20:57:19,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1137 transitions. [2022-11-18 20:57:19,151 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1137 transitions. Word has length 77 [2022-11-18 20:57:19,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:19,156 INFO L495 AbstractCegarLoop]: Abstraction has 840 states and 1137 transitions. [2022-11-18 20:57:19,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-18 20:57:19,156 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1137 transitions. [2022-11-18 20:57:19,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-18 20:57:19,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:19,162 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:57:19,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:57:19,166 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:57:19,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:19,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1596249494, now seen corresponding path program 1 times [2022-11-18 20:57:19,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:19,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664291324] [2022-11-18 20:57:19,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:19,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:19,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:19,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:19,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:19,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:57:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:19,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:19,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:19,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:57:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:19,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:19,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:19,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-18 20:57:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:19,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:19,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:57:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:19,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 20:57:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:19,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:19,487 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-11-18 20:57:19,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:19,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664291324] [2022-11-18 20:57:19,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664291324] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:19,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:19,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:57:19,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9440646] [2022-11-18 20:57:19,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:19,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:57:19,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:19,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:57:19,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:57:19,489 INFO L87 Difference]: Start difference. First operand 840 states and 1137 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-18 20:57:20,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:20,782 INFO L93 Difference]: Finished difference Result 2912 states and 3997 transitions. [2022-11-18 20:57:20,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:57:20,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 119 [2022-11-18 20:57:20,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:20,793 INFO L225 Difference]: With dead ends: 2912 [2022-11-18 20:57:20,794 INFO L226 Difference]: Without dead ends: 2078 [2022-11-18 20:57:20,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:57:20,797 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 595 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:20,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 1092 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-18 20:57:20,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2022-11-18 20:57:20,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1662. [2022-11-18 20:57:20,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1311 states have (on average 1.297482837528604) internal successors, (1701), 1319 states have internal predecessors, (1701), 210 states have call successors, (210), 121 states have call predecessors, (210), 140 states have return successors, (297), 229 states have call predecessors, (297), 209 states have call successors, (297) [2022-11-18 20:57:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2208 transitions. [2022-11-18 20:57:20,953 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2208 transitions. Word has length 119 [2022-11-18 20:57:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:20,954 INFO L495 AbstractCegarLoop]: Abstraction has 1662 states and 2208 transitions. [2022-11-18 20:57:20,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 6 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-18 20:57:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2208 transitions. [2022-11-18 20:57:20,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-18 20:57:20,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:20,960 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:57:20,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:57:20,960 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:57:20,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:20,961 INFO L85 PathProgramCache]: Analyzing trace with hash 162596766, now seen corresponding path program 1 times [2022-11-18 20:57:20,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:20,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170544312] [2022-11-18 20:57:20,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:20,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:21,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:21,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:21,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:21,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:57:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:21,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:21,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:21,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:57:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:21,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:21,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:21,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:57:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:21,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:21,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:57:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:21,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-18 20:57:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:21,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-18 20:57:21,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:21,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170544312] [2022-11-18 20:57:21,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170544312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:21,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:21,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:57:21,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51831554] [2022-11-18 20:57:21,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:21,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:57:21,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:21,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:57:21,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:57:21,305 INFO L87 Difference]: Start difference. First operand 1662 states and 2208 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-18 20:57:22,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:22,207 INFO L93 Difference]: Finished difference Result 2954 states and 4105 transitions. [2022-11-18 20:57:22,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:57:22,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 119 [2022-11-18 20:57:22,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:22,222 INFO L225 Difference]: With dead ends: 2954 [2022-11-18 20:57:22,222 INFO L226 Difference]: Without dead ends: 2070 [2022-11-18 20:57:22,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:57:22,228 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 166 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:22,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 974 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 20:57:22,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2022-11-18 20:57:22,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 1670. [2022-11-18 20:57:22,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1319 states have (on average 1.2956785443517818) internal successors, (1709), 1327 states have internal predecessors, (1709), 210 states have call successors, (210), 121 states have call predecessors, (210), 140 states have return successors, (297), 229 states have call predecessors, (297), 209 states have call successors, (297) [2022-11-18 20:57:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2216 transitions. [2022-11-18 20:57:22,391 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2216 transitions. Word has length 119 [2022-11-18 20:57:22,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:22,392 INFO L495 AbstractCegarLoop]: Abstraction has 1670 states and 2216 transitions. [2022-11-18 20:57:22,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-18 20:57:22,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2216 transitions. [2022-11-18 20:57:22,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-18 20:57:22,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:22,398 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:57:22,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:57:22,399 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:57:22,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:22,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1319541292, now seen corresponding path program 1 times [2022-11-18 20:57:22,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:22,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60670954] [2022-11-18 20:57:22,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:22,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:22,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:22,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:22,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:22,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:57:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:22,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:22,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:22,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:57:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:22,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:22,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:22,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:57:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:22,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:22,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:57:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:22,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-18 20:57:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:22,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-18 20:57:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:23,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:23,111 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-18 20:57:23,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:23,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60670954] [2022-11-18 20:57:23,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60670954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:23,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:23,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-18 20:57:23,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086468360] [2022-11-18 20:57:23,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:23,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 20:57:23,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:23,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 20:57:23,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:57:23,114 INFO L87 Difference]: Start difference. First operand 1670 states and 2216 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-18 20:57:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:25,398 INFO L93 Difference]: Finished difference Result 4250 states and 5733 transitions. [2022-11-18 20:57:25,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-18 20:57:25,399 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) Word has length 127 [2022-11-18 20:57:25,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:25,411 INFO L225 Difference]: With dead ends: 4250 [2022-11-18 20:57:25,412 INFO L226 Difference]: Without dead ends: 2586 [2022-11-18 20:57:25,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2022-11-18 20:57:25,418 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 1488 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 2115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 554 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:25,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1602 Invalid, 2115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [554 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-18 20:57:25,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2022-11-18 20:57:25,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 1698. [2022-11-18 20:57:25,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1335 states have (on average 1.2831460674157302) internal successors, (1713), 1347 states have internal predecessors, (1713), 222 states have call successors, (222), 125 states have call predecessors, (222), 140 states have return successors, (257), 233 states have call predecessors, (257), 221 states have call successors, (257) [2022-11-18 20:57:25,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2192 transitions. [2022-11-18 20:57:25,582 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2192 transitions. Word has length 127 [2022-11-18 20:57:25,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:25,583 INFO L495 AbstractCegarLoop]: Abstraction has 1698 states and 2192 transitions. [2022-11-18 20:57:25,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-18 20:57:25,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2192 transitions. [2022-11-18 20:57:25,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-11-18 20:57:25,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:25,588 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:57:25,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:57:25,589 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:57:25,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:25,589 INFO L85 PathProgramCache]: Analyzing trace with hash -239915446, now seen corresponding path program 1 times [2022-11-18 20:57:25,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:25,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329050094] [2022-11-18 20:57:25,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:25,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:26,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:26,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:26,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:26,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:57:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:26,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:26,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:26,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:57:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:26,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:26,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:26,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:57:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:26,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:26,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:57:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:26,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-18 20:57:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:26,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:26,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:26,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:26,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:26,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-18 20:57:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:26,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:26,630 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-11-18 20:57:26,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:26,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329050094] [2022-11-18 20:57:26,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329050094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:26,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:26,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-18 20:57:26,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911212534] [2022-11-18 20:57:26,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:26,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 20:57:26,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:26,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 20:57:26,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:57:26,633 INFO L87 Difference]: Start difference. First operand 1698 states and 2192 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 9 states have internal predecessors, (78), 5 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 4 states have call successors, (13) [2022-11-18 20:57:29,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:29,785 INFO L93 Difference]: Finished difference Result 4534 states and 6177 transitions. [2022-11-18 20:57:29,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-18 20:57:29,786 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 9 states have internal predecessors, (78), 5 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 4 states have call successors, (13) Word has length 151 [2022-11-18 20:57:29,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:29,809 INFO L225 Difference]: With dead ends: 4534 [2022-11-18 20:57:29,809 INFO L226 Difference]: Without dead ends: 3606 [2022-11-18 20:57:29,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=272, Invalid=988, Unknown=0, NotChecked=0, Total=1260 [2022-11-18 20:57:29,815 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 2141 mSDsluCounter, 2033 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 957 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2180 SdHoareTripleChecker+Valid, 2468 SdHoareTripleChecker+Invalid, 3252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 957 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:29,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2180 Valid, 2468 Invalid, 3252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [957 Valid, 2295 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-18 20:57:29,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2022-11-18 20:57:30,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 2234. [2022-11-18 20:57:30,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2234 states, 1731 states have (on average 1.2576545349508954) internal successors, (2177), 1755 states have internal predecessors, (2177), 266 states have call successors, (266), 153 states have call predecessors, (266), 236 states have return successors, (429), 333 states have call predecessors, (429), 265 states have call successors, (429) [2022-11-18 20:57:30,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2872 transitions. [2022-11-18 20:57:30,094 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2872 transitions. Word has length 151 [2022-11-18 20:57:30,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:30,095 INFO L495 AbstractCegarLoop]: Abstraction has 2234 states and 2872 transitions. [2022-11-18 20:57:30,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 9 states have internal predecessors, (78), 5 states have call successors, (14), 6 states have call predecessors, (14), 4 states have return successors, (13), 8 states have call predecessors, (13), 4 states have call successors, (13) [2022-11-18 20:57:30,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2872 transitions. [2022-11-18 20:57:30,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-11-18 20:57:30,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:30,101 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:57:30,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:57:30,102 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:57:30,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:30,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1665675225, now seen corresponding path program 1 times [2022-11-18 20:57:30,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:30,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993660722] [2022-11-18 20:57:30,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:30,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:30,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:57:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:30,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:30,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:30,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 20:57:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:30,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:30,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:30,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-18 20:57:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:30,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:30,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:30,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-18 20:57:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:30,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:30,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-18 20:57:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:30,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-18 20:57:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:30,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:30,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:30,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:30,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-18 20:57:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:30,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-18 20:57:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:30,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-18 20:57:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:57:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-11-18 20:57:30,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:57:30,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993660722] [2022-11-18 20:57:30,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993660722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:57:30,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:57:30,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 20:57:30,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464748235] [2022-11-18 20:57:30,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:57:30,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:57:30,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:57:30,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:57:30,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:57:30,515 INFO L87 Difference]: Start difference. First operand 2234 states and 2872 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-18 20:57:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:57:31,347 INFO L93 Difference]: Finished difference Result 4214 states and 5577 transitions. [2022-11-18 20:57:31,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 20:57:31,347 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 152 [2022-11-18 20:57:31,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:57:31,370 INFO L225 Difference]: With dead ends: 4214 [2022-11-18 20:57:31,370 INFO L226 Difference]: Without dead ends: 2818 [2022-11-18 20:57:31,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:57:31,376 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 294 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:57:31,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1031 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:57:31,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2022-11-18 20:57:31,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2234. [2022-11-18 20:57:31,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2234 states, 1731 states have (on average 1.2484113229347198) internal successors, (2161), 1755 states have internal predecessors, (2161), 266 states have call successors, (266), 153 states have call predecessors, (266), 236 states have return successors, (429), 333 states have call predecessors, (429), 265 states have call successors, (429) [2022-11-18 20:57:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2856 transitions. [2022-11-18 20:57:31,620 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2856 transitions. Word has length 152 [2022-11-18 20:57:31,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:57:31,621 INFO L495 AbstractCegarLoop]: Abstraction has 2234 states and 2856 transitions. [2022-11-18 20:57:31,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-18 20:57:31,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2856 transitions. [2022-11-18 20:57:31,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-18 20:57:31,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:57:31,628 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:57:31,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:57:31,629 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 20:57:31,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:57:31,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1648213824, now seen corresponding path program 1 times [2022-11-18 20:57:31,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:57:31,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45797597] [2022-11-18 20:57:31,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:57:31,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:57:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:57:31,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 20:57:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 20:57:31,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 20:57:31,927 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 20:57:31,929 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 20:57:31,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:57:31,934 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:57:31,939 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:57:32,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:57:32 BoogieIcfgContainer [2022-11-18 20:57:32,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:57:32,127 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:57:32,127 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:57:32,127 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:57:32,128 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:57:14" (3/4) ... [2022-11-18 20:57:32,130 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 20:57:32,231 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15e6fa79-55a5-49d8-a68a-99aa87a6af71/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:57:32,232 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:57:32,232 INFO L158 Benchmark]: Toolchain (without parser) took 20795.31ms. Allocated memory was 86.0MB in the beginning and 388.0MB in the end (delta: 302.0MB). Free memory was 51.8MB in the beginning and 239.5MB in the end (delta: -187.8MB). Peak memory consumption was 115.8MB. Max. memory is 16.1GB. [2022-11-18 20:57:32,232 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 86.0MB. Free memory was 56.3MB in the beginning and 56.2MB in the end (delta: 48.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:57:32,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1580.15ms. Allocated memory was 86.0MB in the beginning and 123.7MB in the end (delta: 37.7MB). Free memory was 51.5MB in the beginning and 75.5MB in the end (delta: -24.0MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2022-11-18 20:57:32,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 127.28ms. Allocated memory is still 123.7MB. Free memory was 75.5MB in the beginning and 70.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:57:32,233 INFO L158 Benchmark]: Boogie Preprocessor took 116.14ms. Allocated memory is still 123.7MB. Free memory was 70.8MB in the beginning and 65.7MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:57:32,234 INFO L158 Benchmark]: RCFGBuilder took 1284.94ms. Allocated memory is still 123.7MB. Free memory was 65.7MB in the beginning and 44.2MB in the end (delta: 21.5MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2022-11-18 20:57:32,234 INFO L158 Benchmark]: TraceAbstraction took 17573.57ms. Allocated memory was 123.7MB in the beginning and 388.0MB in the end (delta: 264.2MB). Free memory was 43.0MB in the beginning and 260.5MB in the end (delta: -217.5MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2022-11-18 20:57:32,235 INFO L158 Benchmark]: Witness Printer took 104.79ms. Allocated memory is still 388.0MB. Free memory was 260.5MB in the beginning and 239.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-18 20:57:32,236 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.26ms. Allocated memory is still 86.0MB. Free memory was 56.3MB in the beginning and 56.2MB in the end (delta: 48.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1580.15ms. Allocated memory was 86.0MB in the beginning and 123.7MB in the end (delta: 37.7MB). Free memory was 51.5MB in the beginning and 75.5MB in the end (delta: -24.0MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 127.28ms. Allocated memory is still 123.7MB. Free memory was 75.5MB in the beginning and 70.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.14ms. Allocated memory is still 123.7MB. Free memory was 70.8MB in the beginning and 65.7MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1284.94ms. Allocated memory is still 123.7MB. Free memory was 65.7MB in the beginning and 44.2MB in the end (delta: 21.5MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. * TraceAbstraction took 17573.57ms. Allocated memory was 123.7MB in the beginning and 388.0MB in the end (delta: 264.2MB). Free memory was 43.0MB in the beginning and 260.5MB in the end (delta: -217.5MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. * Witness Printer took 104.79ms. Allocated memory is still 388.0MB. Free memory was 260.5MB in the beginning and 239.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 5320]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L5837] Element set_impl[15] ; [L5343] int LDV_IN_INTERRUPT = 1; [L5972] Set LDV_SKBS ; [L5344] struct sk_buff *proto_group0 ; [L5633] int ldv_retval_0 ; [L5838] int last_index = 0; [L5347] struct net_device *proto_group1 ; [L5634] int ldv_retval_1 ; [L5345] int ref_cnt ; [L5564-L5566] static struct hdlc_proto proto = {& x25_open, & x25_close, 0, 0, 0, & x25_ioctl, 0, & x25_rx, & x25_xmit, & __this_module, 0}; [L5348] int ldv_state_variable_0 ; [L5346] int ldv_state_variable_1 ; VAL [__this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}] [L5651] struct ifreq *ldvarg0 ; [L5652] void *tmp ; [L5653] int tmp___0 ; [L5654] int tmp___1 ; [L5655] int tmp___2 ; VAL [__this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}] [L5657] CALL, EXPR ldv_successful_zalloc(40UL) VAL [\old(__size)=40, __this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}] [L5262] EXPR, FCALL calloc(1UL, __size) VAL [\old(__size)=40, __size=40, __this_module={3266:3265}, calloc(1UL, __size)={-2:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}] [L5262] void *p = calloc(1UL, __size); VAL [\old(__size)=40, __size=40, __this_module={3266:3265}, calloc(1UL, __size)={-2:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-2:0}, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}] [L5263] CALL assume_abort_if_not(p != (void *)0) VAL [\old(cond)=1, __this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={3266:3265}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}] [L5263] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=40, __size=40, __this_module={3266:3265}, calloc(1UL, __size)={-2:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-2:0}, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}] [L5264] return p; VAL [\old(__size)=40, \result={-2:0}, __size=40, __this_module={3266:3265}, calloc(1UL, __size)={-2:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, p={-2:0}, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}] [L5657] RET, EXPR ldv_successful_zalloc(40UL) VAL [__this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_successful_zalloc(40UL)={-2:0}, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}] [L5657] tmp = ldv_successful_zalloc(40UL) [L5658] ldvarg0 = (struct ifreq *)tmp [L5659] CALL ldv_initialize() [L5991] CALL ldv_set_init(LDV_SKBS) [L5843] set = set_impl [L5844] last_index = 0 VAL [__this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set={0:0}, set={7:0}, set_impl={7:0}] [L5991] RET ldv_set_init(LDV_SKBS) [L5659] RET ldv_initialize() [L5660] ldv_state_variable_1 = 0 [L5661] ref_cnt = 0 [L5662] ldv_state_variable_0 = 1 VAL [__this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-2:0}, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}, tmp={-2:0}] [L5664] tmp___0 = __VERIFIER_nondet_int() [L5666] case 0: [L5731] case 1: VAL [__this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-2:0}, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}, tmp={-2:0}, tmp___0=1] [L5732] COND TRUE ldv_state_variable_0 != 0 [L5733] tmp___2 = __VERIFIER_nondet_int() [L5735] case 0: [L5743] case 1: VAL [__this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, ldvarg0={-2:0}, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}, tmp={-2:0}, tmp___0=1, tmp___2=1] [L5744] COND TRUE ldv_state_variable_0 == 1 [L5745] CALL, EXPR mod_init() [L5622] FCALL register_hdlc_protocol(& proto) [L5623] return (0); VAL [\result=0, __this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=0, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}] [L5745] RET, EXPR mod_init() [L5745] ldv_retval_1 = mod_init() [L5746] COND TRUE ldv_retval_1 == 0 [L5747] ldv_state_variable_0 = 3 [L5748] ldv_state_variable_1 = 1 [L5749] CALL ldv_initialize_hdlc_proto_1() [L5639] void *tmp ; [L5640] void *tmp___0 ; VAL [__this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}] [L5642] CALL, EXPR ldv_successful_zalloc(3264UL) VAL [\old(__size)=3264, __this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}] [L5262] EXPR, FCALL calloc(1UL, __size) VAL [\old(__size)=3264, __size=3264, __this_module={3266:3265}, calloc(1UL, __size)={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}] [L5262] void *p = calloc(1UL, __size); VAL [\old(__size)=3264, __size=3264, __this_module={3266:3265}, calloc(1UL, __size)={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-3:0}, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}] [L5263] CALL assume_abort_if_not(p != (void *)0) VAL [\old(cond)=1, __this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={3266:3265}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}] [L5263] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=3264, __size=3264, __this_module={3266:3265}, calloc(1UL, __size)={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-3:0}, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}] [L5264] return p; VAL [\old(__size)=3264, \result={-3:0}, __size=3264, __this_module={3266:3265}, calloc(1UL, __size)={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-3:0}, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}] [L5642] RET, EXPR ldv_successful_zalloc(3264UL) VAL [__this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_successful_zalloc(3264UL)={-3:0}, proto={8:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={7:0}] [L5642] tmp = ldv_successful_zalloc(3264UL) [L5643] proto_group1 = (struct net_device *)tmp VAL [__this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, tmp={-3:0}] [L5644] CALL, EXPR ldv_successful_zalloc(232UL) VAL [\old(__size)=232, __this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5262] EXPR, FCALL calloc(1UL, __size) VAL [\old(__size)=232, __size=232, __this_module={3266:3265}, calloc(1UL, __size)={-18446744073709551615:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5262] void *p = calloc(1UL, __size); VAL [\old(__size)=232, __size=232, __this_module={3266:3265}, calloc(1UL, __size)={-18446744073709551615:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551615:0}, proto={8:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5263] CALL assume_abort_if_not(p != (void *)0) VAL [\old(cond)=1, __this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={3266:3265}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5263] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=232, __size=232, __this_module={3266:3265}, calloc(1UL, __size)={-18446744073709551615:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551615:0}, proto={8:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5264] return p; VAL [\old(__size)=232, \result={-18446744073709551615:0}, __size=232, __this_module={3266:3265}, calloc(1UL, __size)={-18446744073709551615:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-18446744073709551615:0}, proto={8:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5644] RET, EXPR ldv_successful_zalloc(232UL) VAL [__this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_successful_zalloc(232UL)={-18446744073709551615:0}, proto={8:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, tmp={-3:0}] [L5644] tmp___0 = ldv_successful_zalloc(232UL) [L5645] proto_group0 = (struct sk_buff *)tmp___0 VAL [__this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, tmp={-3:0}, tmp___0={-18446744073709551615:0}] [L5749] RET ldv_initialize_hdlc_proto_1() [L5752] COND FALSE !(ldv_retval_1 != 0) VAL [__this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, tmp={-2:0}, tmp___0=1, tmp___2=1] [L5664] tmp___0 = __VERIFIER_nondet_int() [L5666] case 0: VAL [__this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, tmp={-2:0}, tmp___0=0, tmp___2=1] [L5667] COND TRUE ldv_state_variable_1 != 0 [L5668] tmp___1 = __VERIFIER_nondet_int() [L5670] case 0: VAL [__this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, tmp={-2:0}, tmp___0=0, tmp___1=0, tmp___2=1] [L5671] COND TRUE ldv_state_variable_1 == 1 VAL [__this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, tmp={-2:0}, tmp___0=0, tmp___1=0, tmp___2=1] [L5672] CALL x25_xmit(proto_group0, proto_group1) VAL [\old(last_index)=0, __this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5471] int result ; VAL [\old(last_index)=0, __this_module={3266:3265}, dev={-3:0}, dev={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, skb={-18446744073709551615:0}, skb={-18446744073709551615:0}] [L5473] CALL assume_abort_if_not(((void*)(skb)) != ((void*) 0)) VAL [\old(cond)=1, \old(last_index)=0, __this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, \old(last_index)=0, __this_module={3266:3265}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5473] RET assume_abort_if_not(((void*)(skb)) != ((void*) 0)) VAL [\old(last_index)=0, __this_module={3266:3265}, dev={-3:0}, dev={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, skb={-18446744073709551615:0}, skb={-18446744073709551615:0}] [L5474] EXPR skb->data VAL [\old(last_index)=0, __this_module={3266:3265}, dev={-3:0}, dev={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, skb={-18446744073709551615:0}, skb={-18446744073709551615:0}, skb->data={0:3267}] [L5474] CALL assume_abort_if_not(((void*)((skb->data))) != ((void*) 0)) VAL [\old(cond)=1, \old(last_index)=0, __this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, \old(last_index)=0, __this_module={3266:3265}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5474] RET assume_abort_if_not(((void*)((skb->data))) != ((void*) 0)) VAL [\old(last_index)=0, __this_module={3266:3265}, dev={-3:0}, dev={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, skb={-18446744073709551615:0}, skb={-18446744073709551615:0}, skb->data={0:3267}] [L5475] skb->data [L5476] case 0: [L5484] case 1: [L5485] CALL, EXPR lapb_connect_request(dev) [L6068] return __VERIFIER_nondet_int(); [L5485] RET, EXPR lapb_connect_request(dev) [L5485] result = lapb_connect_request(dev) [L5486] COND TRUE result != 0 VAL [\old(last_index)=0, __this_module={3266:3265}, dev={-3:0}, dev={-3:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, result=3, set_impl={7:0}, skb={-18446744073709551615:0}, skb={-18446744073709551615:0}, skb->data={0:3267}skb->data=257] [L5487] COND TRUE result == 3 [L5488] CALL x25_connected(dev, 0) [L5428] CALL x25_connect_disconnect(dev, reason, 1) VAL [\old(last_index)=0, __this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5409] struct sk_buff *skb ; [L5410] unsigned char *ptr ; [L5412] CALL, EXPR ldv_dev_alloc_skb_12(1U) [L5814] struct sk_buff *tmp ; VAL [\old(last_index)=0, \old(length)=1, __this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, length=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5816] CALL, EXPR ldv_skb_alloc() VAL [\old(last_index)=0, __this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5975] void *skb ; [L5976] void *tmp___7 ; VAL [\old(last_index)=0, __this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5978] CALL, EXPR ldv_successful_zalloc(sizeof(struct sk_buff___0 )) VAL [\old(__size)=248, \old(last_index)=0, __this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5262] EXPR, FCALL calloc(1UL, __size) VAL [\old(__size)=248, \old(last_index)=0, __size=248, __this_module={3266:3265}, calloc(1UL, __size)={-36893488147419103232:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5262] void *p = calloc(1UL, __size); VAL [\old(__size)=248, \old(last_index)=0, __size=248, __this_module={3266:3265}, calloc(1UL, __size)={-36893488147419103232:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103232:0}, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5263] CALL assume_abort_if_not(p != (void *)0) VAL [\old(cond)=1, \old(last_index)=0, __this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5259] COND FALSE !(!cond) VAL [\old(cond)=1, \old(last_index)=0, __this_module={3266:3265}, cond=1, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5263] RET assume_abort_if_not(p != (void *)0) VAL [\old(__size)=248, \old(last_index)=0, __size=248, __this_module={3266:3265}, calloc(1UL, __size)={-36893488147419103232:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103232:0}, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5264] return p; VAL [\old(__size)=248, \old(last_index)=0, \result={-36893488147419103232:0}, __size=248, __this_module={3266:3265}, calloc(1UL, __size)={-36893488147419103232:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, p={-36893488147419103232:0}, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5978] RET, EXPR ldv_successful_zalloc(sizeof(struct sk_buff___0 )) VAL [\old(last_index)=0, __this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_successful_zalloc(sizeof(struct sk_buff___0 ))={-36893488147419103232:0}, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5978] tmp___7 = ldv_successful_zalloc(sizeof(struct sk_buff___0 )) [L5979] skb = (struct sk_buff___0 *)tmp___7 VAL [\old(last_index)=0, __this_module={3266:3265}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, skb={-36893488147419103232:0}, tmp___7={-36893488147419103232:0}] [L5980] COND FALSE !(! skb) [L5983] CALL ldv_set_add(LDV_SKBS, skb) [L5851] int i ; [L5853] i = 0 VAL [\old(last_index)=0, __this_module={3266:3265}, e={-36893488147419103232:0}, e={-36893488147419103232:0}, i=0, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={7:0}] [L5854] COND TRUE 1 VAL [\old(last_index)=0, __this_module={3266:3265}, e={-36893488147419103232:0}, e={-36893488147419103232:0}, i=0, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={7:0}] [L5855] COND FALSE !(i < last_index) VAL [\old(last_index)=0, __this_module={3266:3265}, e={-36893488147419103232:0}, e={-36893488147419103232:0}, i=0, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={7:0}] [L5865] COND TRUE last_index < 15 [L5866] set_impl[last_index] = e [L5867] last_index = last_index + 1 VAL [\old(last_index)=0, __this_module={3266:3265}, e={-36893488147419103232:0}, e={-36893488147419103232:0}, i=0, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={7:0}] [L5983] RET ldv_set_add(LDV_SKBS, skb) [L5984] return (skb); VAL [\old(last_index)=0, \result={-36893488147419103232:0}, __this_module={3266:3265}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, skb={-36893488147419103232:0}, tmp___7={-36893488147419103232:0}] [L5816] RET, EXPR ldv_skb_alloc() VAL [\old(last_index)=0, \old(length)=1, __this_module={3266:3265}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_skb_alloc()={-36893488147419103232:0}, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, length=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5816] tmp = ldv_skb_alloc() [L5817] return (tmp); VAL [\old(last_index)=0, \old(length)=1, \result={-36893488147419103232:0}, __this_module={3266:3265}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, length=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, tmp={-36893488147419103232:0}] [L5412] RET, EXPR ldv_dev_alloc_skb_12(1U) [L5412] skb = ldv_dev_alloc_skb_12(1U) [L5413] COND TRUE (unsigned long )skb == (unsigned long )((struct sk_buff *)0) [L5428] RET x25_connect_disconnect(dev, reason, 1) VAL [\old(last_index)=0, \old(reason)=0, __this_module={3266:3265}, dev={-3:0}, dev={-3:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, reason=0, ref_cnt=0, set_impl={7:0}] [L5488] RET x25_connected(dev, 0) [L5512] CALL ldv_skb_free(skb) VAL [\old(last_index)=1, __this_module={3266:3265}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, skb={-18446744073709551615:0}] [L5998] CALL ldv_set_remove(LDV_SKBS, skb) VAL [\old(last_index)=1, __this_module={3266:3265}, e={-18446744073709551615:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set_impl={7:0}] [L5876] int i ; [L5877] int deleted_index ; [L5879] deleted_index = -1 [L5880] i = 0 VAL [\old(last_index)=1, __this_module={3266:3265}, deleted_index=-1, e={-18446744073709551615:0}, e={-18446744073709551615:0}, i=0, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={7:0}] [L5881] COND TRUE 1 VAL [\old(last_index)=1, __this_module={3266:3265}, deleted_index=-1, e={-18446744073709551615:0}, e={-18446744073709551615:0}, i=0, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={7:0}] [L5882] COND TRUE i < last_index VAL [\old(last_index)=1, __this_module={3266:3265}, deleted_index=-1, e={-18446744073709551615:0}, e={-18446744073709551615:0}, i=0, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={7:0}] [L5886] EXPR set_impl[i] VAL [\old(last_index)=1, __this_module={3266:3265}, deleted_index=-1, e={-18446744073709551615:0}, e={-18446744073709551615:0}, i=0, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={7:0}, set_impl[i]={-36893488147419103232:0}] [L5886] COND FALSE !((unsigned long )set_impl[i] == (unsigned long )e) [L5891] i = i + 1 VAL [\old(last_index)=1, __this_module={3266:3265}, deleted_index=-1, e={-18446744073709551615:0}, e={-18446744073709551615:0}, i=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={7:0}] [L5881] COND TRUE 1 VAL [\old(last_index)=1, __this_module={3266:3265}, deleted_index=-1, e={-18446744073709551615:0}, e={-18446744073709551615:0}, i=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={7:0}] [L5882] COND FALSE !(i < last_index) VAL [\old(last_index)=1, __this_module={3266:3265}, deleted_index=-1, e={-18446744073709551615:0}, e={-18446744073709551615:0}, i=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={7:0}] [L5893] COND FALSE !(deleted_index != -1) VAL [\old(last_index)=1, __this_module={3266:3265}, deleted_index=-1, e={-18446744073709551615:0}, e={-18446744073709551615:0}, i=1, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={7:0}] [L5998] RET ldv_set_remove(LDV_SKBS, skb) VAL [\old(last_index)=1, __this_module={3266:3265}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, skb={-18446744073709551615:0}, skb={-18446744073709551615:0}] [L5512] RET ldv_skb_free(skb) VAL [\old(last_index)=0, __this_module={3266:3265}, dev={-3:0}, dev={-3:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, result=3, set_impl={7:0}, skb={-18446744073709551615:0}, skb={-18446744073709551615:0}, skb->data=257skb->data={0:3267}] [L5513] return (0); VAL [\old(last_index)=0, \result=0, __this_module={3266:3265}, dev={-3:0}, dev={-3:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, result=3, set_impl={7:0}, skb={-18446744073709551615:0}, skb={-18446744073709551615:0}, skb->data=257skb->data={0:3267}] [L5672] RET x25_xmit(proto_group0, proto_group1) VAL [__this_module={3266:3265}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, tmp={-2:0}, tmp___0=0, tmp___1=0, tmp___2=1, x25_xmit(proto_group0, proto_group1)=0] [L5673] ldv_state_variable_1 = 1 VAL [__this_module={3266:3265}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, tmp={-2:0}, tmp___0=0, tmp___1=0, tmp___2=1] [L5676] COND FALSE !(ldv_state_variable_1 == 2) VAL [__this_module={3266:3265}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, tmp={-2:0}, tmp___0=0, tmp___1=0, tmp___2=1] [L5664] tmp___0 = __VERIFIER_nondet_int() [L5666] case 0: [L5731] case 1: VAL [__this_module={3266:3265}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, tmp={-2:0}, tmp___0=1, tmp___1=0, tmp___2=1] [L5732] COND TRUE ldv_state_variable_0 != 0 [L5733] tmp___2 = __VERIFIER_nondet_int() [L5735] case 0: VAL [__this_module={3266:3265}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, tmp={-2:0}, tmp___0=1, tmp___1=0, tmp___2=0] [L5736] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L5737] CALL mod_exit() [L5629] FCALL unregister_hdlc_protocol(& proto) [L5737] RET mod_exit() [L5738] ldv_state_variable_0 = 2 VAL [__this_module={3266:3265}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ldvarg0={-2:0}, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, tmp={-2:0}, tmp___0=1, tmp___1=0, tmp___2=0] [L5773] CALL ldv_check_final_state() [L6042] int tmp___7 ; [L6044] CALL, EXPR ldv_set_is_empty(LDV_SKBS) [L5933] return (last_index == 0); VAL [\result=0, __this_module={3266:3265}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={7:0}] [L6044] RET, EXPR ldv_set_is_empty(LDV_SKBS) [L6044] tmp___7 = ldv_set_is_empty(LDV_SKBS) [L6045] COND FALSE !(\read(tmp___7)) VAL [__this_module={3266:3265}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}, tmp___7=0] [L6047] CALL ldv_error() VAL [__this_module={3266:3265}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] [L5320] reach_error() VAL [__this_module={3266:3265}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, proto={8:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 238 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.3s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6702 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6593 mSDsluCounter, 9737 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7584 mSDsCounter, 2405 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6566 IncrementalHoareTripleChecker+Invalid, 8971 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2405 mSolverCounterUnsat, 2153 mSDtfsCounter, 6566 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2234occurred in iteration=7, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 4068 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 968 NumberOfCodeBlocks, 968 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 806 ConstructedInterpolants, 0 QuantifiedInterpolants, 1754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 542/542 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 proved your program to be incorrect! [2022-11-18 20:57:32,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_15e6fa79-55a5-49d8-a68a-99aa87a6af71/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE