./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 6b4ec56b 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_1a7b9904-5ea6-47df-975b-b91ecbba03f9/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a7b9904-5ea6-47df-975b-b91ecbba03f9/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a7b9904-5ea6-47df-975b-b91ecbba03f9/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a7b9904-5ea6-47df-975b-b91ecbba03f9/bin/uautomizer-ug76WZFUDN/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_1a7b9904-5ea6-47df-975b-b91ecbba03f9/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a7b9904-5ea6-47df-975b-b91ecbba03f9/bin/uautomizer-ug76WZFUDN --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-6b4ec56 [2022-11-20 11:07:19,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:07:19,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:07:19,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:07:19,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:07:19,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:07:19,347 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:07:19,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:07:19,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:07:19,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:07:19,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:07:19,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:07:19,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:07:19,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:07:19,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:07:19,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:07:19,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:07:19,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:07:19,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:07:19,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:07:19,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:07:19,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:07:19,391 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:07:19,392 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:07:19,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:07:19,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:07:19,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:07:19,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:07:19,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:07:19,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:07:19,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:07:19,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:07:19,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:07:19,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:07:19,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:07:19,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:07:19,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:07:19,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:07:19,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:07:19,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:07:19,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:07:19,420 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a7b9904-5ea6-47df-975b-b91ecbba03f9/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-20 11:07:19,461 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:07:19,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:07:19,461 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:07:19,462 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:07:19,462 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:07:19,465 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:07:19,466 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:07:19,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:07:19,467 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:07:19,467 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:07:19,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:07:19,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:07:19,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:07:19,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:07:19,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:07:19,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:07:19,470 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:07:19,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:07:19,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:07:19,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:07:19,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:07:19,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:07:19,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:07:19,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:07:19,473 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:07:19,473 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:07:19,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:07:19,474 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:07:19,474 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:07:19,474 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:07:19,475 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_1a7b9904-5ea6-47df-975b-b91ecbba03f9/bin/uautomizer-ug76WZFUDN/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_1a7b9904-5ea6-47df-975b-b91ecbba03f9/bin/uautomizer-ug76WZFUDN 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-20 11:07:19,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:07:19,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:07:19,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:07:19,814 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:07:19,814 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:07:19,816 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a7b9904-5ea6-47df-975b-b91ecbba03f9/bin/uautomizer-ug76WZFUDN/../../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-20 11:07:22,887 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:07:23,413 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:07:23,414 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a7b9904-5ea6-47df-975b-b91ecbba03f9/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-20 11:07:23,443 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a7b9904-5ea6-47df-975b-b91ecbba03f9/bin/uautomizer-ug76WZFUDN/data/c863e98a4/a554b52fea864a05b65b09ddc1c8a509/FLAG86fa5a4b8 [2022-11-20 11:07:23,458 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a7b9904-5ea6-47df-975b-b91ecbba03f9/bin/uautomizer-ug76WZFUDN/data/c863e98a4/a554b52fea864a05b65b09ddc1c8a509 [2022-11-20 11:07:23,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:07:23,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:07:23,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:07:23,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:07:23,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:07:23,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:07:23" (1/1) ... [2022-11-20 11:07:23,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36758831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:23, skipping insertion in model container [2022-11-20 11:07:23,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:07:23" (1/1) ... [2022-11-20 11:07:23,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:07:23,604 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:07:24,379 WARN L237 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_1a7b9904-5ea6-47df-975b-b91ecbba03f9/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-20 11:07:24,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:07:24,754 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:07:25,045 WARN L237 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_1a7b9904-5ea6-47df-975b-b91ecbba03f9/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-20 11:07:25,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:07:25,182 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:07:25,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:25 WrapperNode [2022-11-20 11:07:25,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:07:25,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:07:25,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:07:25,187 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:07:25,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:25" (1/1) ... [2022-11-20 11:07:25,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:25" (1/1) ... [2022-11-20 11:07:25,310 INFO L138 Inliner]: procedures = 110, calls = 180, calls flagged for inlining = 54, calls inlined = 43, statements flattened = 631 [2022-11-20 11:07:25,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:07:25,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:07:25,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:07:25,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:07:25,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:25" (1/1) ... [2022-11-20 11:07:25,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:25" (1/1) ... [2022-11-20 11:07:25,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:25" (1/1) ... [2022-11-20 11:07:25,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:25" (1/1) ... [2022-11-20 11:07:25,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:25" (1/1) ... [2022-11-20 11:07:25,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:25" (1/1) ... [2022-11-20 11:07:25,419 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:25" (1/1) ... [2022-11-20 11:07:25,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:25" (1/1) ... [2022-11-20 11:07:25,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:07:25,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:07:25,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:07:25,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:07:25,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:25" (1/1) ... [2022-11-20 11:07:25,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:07:25,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a7b9904-5ea6-47df-975b-b91ecbba03f9/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:07:25,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a7b9904-5ea6-47df-975b-b91ecbba03f9/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:07:25,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a7b9904-5ea6-47df-975b-b91ecbba03f9/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:07:25,537 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-20 11:07:25,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-20 11:07:25,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:07:25,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-20 11:07:25,538 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-20 11:07:25,538 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-11-20 11:07:25,538 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-11-20 11:07:25,538 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-11-20 11:07:25,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-11-20 11:07:25,539 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-20 11:07:25,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-20 11:07:25,539 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-11-20 11:07:25,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-11-20 11:07:25,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:07:25,540 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-20 11:07:25,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-20 11:07:25,540 INFO L130 BoogieDeclarations]: Found specification of procedure x25_ioctl [2022-11-20 11:07:25,540 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_ioctl [2022-11-20 11:07:25,540 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-11-20 11:07:25,540 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-11-20 11:07:25,541 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-20 11:07:25,541 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-20 11:07:25,541 INFO L130 BoogieDeclarations]: Found specification of procedure x25_connect_disconnect [2022-11-20 11:07:25,541 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_connect_disconnect [2022-11-20 11:07:25,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:07:25,541 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free_int [2022-11-20 11:07:25,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free_int [2022-11-20 11:07:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:07:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure x25_type_trans [2022-11-20 11:07:25,542 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_type_trans [2022-11-20 11:07:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure x25_xmit [2022-11-20 11:07:25,542 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_xmit [2022-11-20 11:07:25,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:07:25,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 11:07:25,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 11:07:25,545 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-11-20 11:07:25,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-11-20 11:07:25,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:07:25,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 11:07:25,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_zalloc [2022-11-20 11:07:25,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_zalloc [2022-11-20 11:07:25,547 INFO L130 BoogieDeclarations]: Found specification of procedure x25_rx [2022-11-20 11:07:25,547 INFO L138 BoogieDeclarations]: Found implementation of procedure x25_rx [2022-11-20 11:07:25,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:07:25,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:07:25,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:07:25,892 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:07:25,895 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:07:26,229 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-20 11:07:26,778 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:07:26,786 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:07:26,787 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-20 11:07:26,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:07:26 BoogieIcfgContainer [2022-11-20 11:07:26,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:07:26,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:07:26,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:07:26,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:07:26,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:07:23" (1/3) ... [2022-11-20 11:07:26,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f754f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:07:26, skipping insertion in model container [2022-11-20 11:07:26,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:07:25" (2/3) ... [2022-11-20 11:07:26,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f754f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:07:26, skipping insertion in model container [2022-11-20 11:07:26,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:07:26" (3/3) ... [2022-11-20 11:07:26,799 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-20 11:07:26,819 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:07:26,819 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 11:07:26,891 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:07:26,898 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;@5b61f5a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:07:26,899 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 11:07:26,904 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-20 11:07:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-20 11:07:26,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:07:26,916 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-20 11:07:26,916 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:07:26,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:07:26,922 INFO L85 PathProgramCache]: Analyzing trace with hash 898254007, now seen corresponding path program 1 times [2022-11-20 11:07:26,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:07:26,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261298513] [2022-11-20 11:07:26,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:26,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:07:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:27,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:07:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:27,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:27,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:27,471 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-20 11:07:27,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:07:27,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261298513] [2022-11-20 11:07:27,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261298513] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:07:27,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:07:27,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:07:27,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316835919] [2022-11-20 11:07:27,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:07:27,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 11:07:27,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:07:27,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 11:07:27,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 11:07:27,538 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-20 11:07:28,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:07:28,509 INFO L93 Difference]: Finished difference Result 786 states and 1141 transitions. [2022-11-20 11:07:28,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:07:28,512 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-20 11:07:28,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:07:28,528 INFO L225 Difference]: With dead ends: 786 [2022-11-20 11:07:28,528 INFO L226 Difference]: Without dead ends: 540 [2022-11-20 11:07:28,535 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-20 11:07:28,539 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 765 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:07:28,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 635 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-20 11:07:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-11-20 11:07:28,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 432. [2022-11-20 11:07:28,632 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-20 11:07:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 572 transitions. [2022-11-20 11:07:28,638 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 572 transitions. Word has length 33 [2022-11-20 11:07:28,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:07:28,639 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 572 transitions. [2022-11-20 11:07:28,639 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-20 11:07:28,639 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 572 transitions. [2022-11-20 11:07:28,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 11:07:28,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:07:28,642 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-20 11:07:28,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:07:28,643 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:07:28,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:07:28,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1941540429, now seen corresponding path program 1 times [2022-11-20 11:07:28,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:07:28,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333102169] [2022-11-20 11:07:28,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:28,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:07:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:28,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:07:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:28,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:28,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:28,937 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-20 11:07:28,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:07:28,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333102169] [2022-11-20 11:07:28,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333102169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:07:28,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:07:28,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:07:28,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359479643] [2022-11-20 11:07:28,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:07:28,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:07:28,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:07:28,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:07:28,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:07:28,942 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-20 11:07:29,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:07:29,619 INFO L93 Difference]: Finished difference Result 965 states and 1293 transitions. [2022-11-20 11:07:29,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:07:29,620 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-20 11:07:29,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:07:29,633 INFO L225 Difference]: With dead ends: 965 [2022-11-20 11:07:29,633 INFO L226 Difference]: Without dead ends: 539 [2022-11-20 11:07:29,638 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-20 11:07:29,644 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 625 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:07:29,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 687 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:07:29,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-11-20 11:07:29,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 431. [2022-11-20 11:07:29,730 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-20 11:07:29,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 568 transitions. [2022-11-20 11:07:29,735 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 568 transitions. Word has length 36 [2022-11-20 11:07:29,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:07:29,735 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 568 transitions. [2022-11-20 11:07:29,736 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-20 11:07:29,736 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 568 transitions. [2022-11-20 11:07:29,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-20 11:07:29,741 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:07:29,741 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-20 11:07:29,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:07:29,742 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:07:29,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:07:29,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2029658452, now seen corresponding path program 1 times [2022-11-20 11:07:29,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:07:29,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687650436] [2022-11-20 11:07:29,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:29,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:07:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:29,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:07:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:30,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:30,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:30,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:07:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:30,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:30,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:30,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:07:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:30,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:30,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:30,092 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-20 11:07:30,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:07:30,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687650436] [2022-11-20 11:07:30,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687650436] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:07:30,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:07:30,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:07:30,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977783502] [2022-11-20 11:07:30,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:07:30,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:07:30,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:07:30,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:07:30,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:07:30,096 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-20 11:07:31,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:07:31,140 INFO L93 Difference]: Finished difference Result 1462 states and 2036 transitions. [2022-11-20 11:07:31,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 11:07:31,141 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-20 11:07:31,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:07:31,152 INFO L225 Difference]: With dead ends: 1462 [2022-11-20 11:07:31,153 INFO L226 Difference]: Without dead ends: 1032 [2022-11-20 11:07:31,155 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-20 11:07:31,164 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 520 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 11:07:31,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1258 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 11:07:31,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2022-11-20 11:07:31,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 840. [2022-11-20 11:07:31,265 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-20 11:07:31,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1137 transitions. [2022-11-20 11:07:31,273 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1137 transitions. Word has length 77 [2022-11-20 11:07:31,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:07:31,275 INFO L495 AbstractCegarLoop]: Abstraction has 840 states and 1137 transitions. [2022-11-20 11:07:31,275 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-20 11:07:31,276 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1137 transitions. [2022-11-20 11:07:31,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-20 11:07:31,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:07:31,287 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-20 11:07:31,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:07:31,291 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:07:31,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:07:31,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1596249494, now seen corresponding path program 1 times [2022-11-20 11:07:31,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:07:31,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975560569] [2022-11-20 11:07:31,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:31,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:07:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:31,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:07:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:31,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:31,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:31,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:07:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:31,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:31,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:31,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:07:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:31,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:31,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:31,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 11:07:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:31,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:31,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 11:07:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:31,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 11:07:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:31,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:31,644 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-20 11:07:31,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:07:31,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975560569] [2022-11-20 11:07:31,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975560569] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:07:31,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:07:31,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:07:31,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265688400] [2022-11-20 11:07:31,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:07:31,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:07:31,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:07:31,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:07:31,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:07:31,653 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-20 11:07:33,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:07:33,080 INFO L93 Difference]: Finished difference Result 2912 states and 3997 transitions. [2022-11-20 11:07:33,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:07:33,081 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-20 11:07:33,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:07:33,095 INFO L225 Difference]: With dead ends: 2912 [2022-11-20 11:07:33,095 INFO L226 Difference]: Without dead ends: 2078 [2022-11-20 11:07:33,099 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-20 11:07:33,102 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 594 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:07:33,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 1103 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-20 11:07:33,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2022-11-20 11:07:33,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1662. [2022-11-20 11:07:33,266 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-20 11:07:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2208 transitions. [2022-11-20 11:07:33,277 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2208 transitions. Word has length 119 [2022-11-20 11:07:33,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:07:33,279 INFO L495 AbstractCegarLoop]: Abstraction has 1662 states and 2208 transitions. [2022-11-20 11:07:33,279 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-20 11:07:33,279 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2208 transitions. [2022-11-20 11:07:33,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-20 11:07:33,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:07:33,292 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-20 11:07:33,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:07:33,293 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:07:33,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:07:33,294 INFO L85 PathProgramCache]: Analyzing trace with hash 162596766, now seen corresponding path program 1 times [2022-11-20 11:07:33,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:07:33,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338174690] [2022-11-20 11:07:33,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:33,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:07:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:33,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:07:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:33,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:33,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:33,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:07:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:33,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:33,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:33,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:07:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:33,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:33,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:33,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 11:07:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:33,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:33,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 11:07:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:33,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-20 11:07:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:33,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:33,687 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-20 11:07:33,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:07:33,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338174690] [2022-11-20 11:07:33,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338174690] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:07:33,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:07:33,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:07:33,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714058783] [2022-11-20 11:07:33,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:07:33,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:07:33,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:07:33,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:07:33,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:07:33,690 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-20 11:07:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:07:34,535 INFO L93 Difference]: Finished difference Result 2954 states and 4105 transitions. [2022-11-20 11:07:34,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:07:34,536 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-20 11:07:34,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:07:34,548 INFO L225 Difference]: With dead ends: 2954 [2022-11-20 11:07:34,548 INFO L226 Difference]: Without dead ends: 2070 [2022-11-20 11:07:34,552 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-20 11:07:34,553 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 166 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 11:07:34,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 965 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 11:07:34,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2022-11-20 11:07:34,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 1670. [2022-11-20 11:07:34,746 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-20 11:07:34,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2216 transitions. [2022-11-20 11:07:34,757 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2216 transitions. Word has length 119 [2022-11-20 11:07:34,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:07:34,757 INFO L495 AbstractCegarLoop]: Abstraction has 1670 states and 2216 transitions. [2022-11-20 11:07:34,758 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-20 11:07:34,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2216 transitions. [2022-11-20 11:07:34,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-20 11:07:34,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:07:34,765 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-20 11:07:34,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:07:34,766 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:07:34,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:07:34,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1319541292, now seen corresponding path program 1 times [2022-11-20 11:07:34,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:07:34,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790209055] [2022-11-20 11:07:34,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:34,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:07:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:35,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:07:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:35,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:35,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:35,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:07:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:35,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:35,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:35,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:07:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:35,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:35,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:35,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 11:07:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:35,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:35,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 11:07:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:35,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 11:07:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:35,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-20 11:07:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:35,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:35,589 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-20 11:07:35,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:07:35,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790209055] [2022-11-20 11:07:35,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790209055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:07:35,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:07:35,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-20 11:07:35,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079103853] [2022-11-20 11:07:35,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:07:35,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 11:07:35,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:07:35,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 11:07:35,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:07:35,593 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-20 11:07:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:07:37,910 INFO L93 Difference]: Finished difference Result 4250 states and 5733 transitions. [2022-11-20 11:07:37,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 11:07:37,911 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-20 11:07:37,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:07:37,928 INFO L225 Difference]: With dead ends: 4250 [2022-11-20 11:07:37,928 INFO L226 Difference]: Without dead ends: 2586 [2022-11-20 11:07:37,936 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-20 11:07:37,937 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 1490 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 1545 mSolverCounterSat, 559 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 2104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 559 IncrementalHoareTripleChecker+Valid, 1545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:07:37,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1598 Invalid, 2104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [559 Valid, 1545 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-20 11:07:37,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2022-11-20 11:07:38,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 1698. [2022-11-20 11:07:38,130 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-20 11:07:38,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2192 transitions. [2022-11-20 11:07:38,138 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2192 transitions. Word has length 127 [2022-11-20 11:07:38,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:07:38,139 INFO L495 AbstractCegarLoop]: Abstraction has 1698 states and 2192 transitions. [2022-11-20 11:07:38,139 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-20 11:07:38,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2192 transitions. [2022-11-20 11:07:38,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-11-20 11:07:38,144 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:07:38,144 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-20 11:07:38,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:07:38,145 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:07:38,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:07:38,145 INFO L85 PathProgramCache]: Analyzing trace with hash -239915446, now seen corresponding path program 1 times [2022-11-20 11:07:38,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:07:38,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503203811] [2022-11-20 11:07:38,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:38,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:07:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:38,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:07:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:38,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:38,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:38,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:07:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:38,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:38,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:38,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:07:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:38,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:38,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:38,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 11:07:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:38,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:38,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 11:07:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:38,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 11:07:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:38,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:39,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:39,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:39,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:39,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 11:07:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:39,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:39,191 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-20 11:07:39,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:07:39,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503203811] [2022-11-20 11:07:39,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503203811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:07:39,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:07:39,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-20 11:07:39,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263805900] [2022-11-20 11:07:39,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:07:39,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 11:07:39,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:07:39,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 11:07:39,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-20 11:07:39,195 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-20 11:07:42,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:07:42,516 INFO L93 Difference]: Finished difference Result 4534 states and 6177 transitions. [2022-11-20 11:07:42,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-20 11:07:42,517 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-20 11:07:42,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:07:42,537 INFO L225 Difference]: With dead ends: 4534 [2022-11-20 11:07:42,537 INFO L226 Difference]: Without dead ends: 3606 [2022-11-20 11:07:42,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=272, Invalid=988, Unknown=0, NotChecked=0, Total=1260 [2022-11-20 11:07:42,543 INFO L413 NwaCegarLoop]: 440 mSDtfsCounter, 2143 mSDsluCounter, 2032 mSDsCounter, 0 mSdLazyCounter, 2320 mSolverCounterSat, 955 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2181 SdHoareTripleChecker+Valid, 2472 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 955 IncrementalHoareTripleChecker+Valid, 2320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:07:42,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2181 Valid, 2472 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [955 Valid, 2320 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-20 11:07:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2022-11-20 11:07:42,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 2234. [2022-11-20 11:07:42,835 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-20 11:07:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2872 transitions. [2022-11-20 11:07:42,846 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2872 transitions. Word has length 151 [2022-11-20 11:07:42,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:07:42,847 INFO L495 AbstractCegarLoop]: Abstraction has 2234 states and 2872 transitions. [2022-11-20 11:07:42,847 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-20 11:07:42,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2872 transitions. [2022-11-20 11:07:42,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-11-20 11:07:42,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:07:42,855 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, 1] [2022-11-20 11:07:42,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 11:07:42,855 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:07:42,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:07:42,856 INFO L85 PathProgramCache]: Analyzing trace with hash -405882487, now seen corresponding path program 1 times [2022-11-20 11:07:42,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:07:42,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433394808] [2022-11-20 11:07:42,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:42,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:07:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:43,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:07:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:43,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:43,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:43,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-20 11:07:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:43,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:43,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:43,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:07:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:43,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:43,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:43,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-20 11:07:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:43,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:43,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-11-20 11:07:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:43,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-20 11:07:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:43,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:43,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:43,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:43,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 11:07:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:43,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 11:07:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:43,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:07:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:07:43,335 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-20 11:07:43,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:07:43,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433394808] [2022-11-20 11:07:43,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433394808] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:07:43,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:07:43,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 11:07:43,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408617913] [2022-11-20 11:07:43,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:07:43,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 11:07:43,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:07:43,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 11:07:43,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-20 11:07:43,339 INFO L87 Difference]: Start difference. First operand 2234 states and 2872 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 4 states have internal predecessors, (80), 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-20 11:07:44,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:07:44,203 INFO L93 Difference]: Finished difference Result 4214 states and 5577 transitions. [2022-11-20 11:07:44,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 11:07:44,204 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 4 states have internal predecessors, (80), 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 153 [2022-11-20 11:07:44,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:07:44,218 INFO L225 Difference]: With dead ends: 4214 [2022-11-20 11:07:44,218 INFO L226 Difference]: Without dead ends: 2818 [2022-11-20 11:07:44,223 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-20 11:07:44,224 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 319 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:07:44,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 926 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 11:07:44,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2022-11-20 11:07:44,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2234. [2022-11-20 11:07:44,443 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-20 11:07:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 2856 transitions. [2022-11-20 11:07:44,451 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 2856 transitions. Word has length 153 [2022-11-20 11:07:44,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:07:44,452 INFO L495 AbstractCegarLoop]: Abstraction has 2234 states and 2856 transitions. [2022-11-20 11:07:44,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 4 states have internal predecessors, (80), 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-20 11:07:44,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 2856 transitions. [2022-11-20 11:07:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-20 11:07:44,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:07:44,457 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-20 11:07:44,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 11:07:44,458 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 11:07:44,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:07:44,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1648213824, now seen corresponding path program 1 times [2022-11-20 11:07:44,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:07:44,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956851034] [2022-11-20 11:07:44,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:07:44,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:07:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:07:44,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 11:07:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 11:07:44,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 11:07:44,740 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 11:07:44,743 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 11:07:44,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 11:07:44,751 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:07:44,755 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 11:07:44,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:07:44 BoogieIcfgContainer [2022-11-20 11:07:44,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 11:07:44,936 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 11:07:44,936 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 11:07:44,936 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 11:07:44,937 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:07:26" (3/4) ... [2022-11-20 11:07:44,939 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 11:07:45,089 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a7b9904-5ea6-47df-975b-b91ecbba03f9/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 11:07:45,089 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 11:07:45,090 INFO L158 Benchmark]: Toolchain (without parser) took 21628.09ms. Allocated memory was 201.3MB in the beginning and 459.3MB in the end (delta: 257.9MB). Free memory was 159.3MB in the beginning and 206.6MB in the end (delta: -47.3MB). Peak memory consumption was 213.3MB. Max. memory is 16.1GB. [2022-11-20 11:07:45,093 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 142.6MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 11:07:45,093 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1721.08ms. Allocated memory is still 201.3MB. Free memory was 159.3MB in the beginning and 133.1MB in the end (delta: 26.2MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. [2022-11-20 11:07:45,094 INFO L158 Benchmark]: Boogie Procedure Inliner took 129.46ms. Allocated memory is still 201.3MB. Free memory was 133.0MB in the beginning and 128.1MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 11:07:45,094 INFO L158 Benchmark]: Boogie Preprocessor took 126.42ms. Allocated memory is still 201.3MB. Free memory was 128.1MB in the beginning and 123.7MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 11:07:45,095 INFO L158 Benchmark]: RCFGBuilder took 1346.43ms. Allocated memory is still 201.3MB. Free memory was 123.7MB in the beginning and 126.6MB in the end (delta: -2.9MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2022-11-20 11:07:45,095 INFO L158 Benchmark]: TraceAbstraction took 18143.68ms. Allocated memory was 201.3MB in the beginning and 459.3MB in the end (delta: 257.9MB). Free memory was 126.6MB in the beginning and 226.6MB in the end (delta: -99.9MB). Peak memory consumption was 157.0MB. Max. memory is 16.1GB. [2022-11-20 11:07:45,095 INFO L158 Benchmark]: Witness Printer took 153.52ms. Allocated memory is still 459.3MB. Free memory was 226.6MB in the beginning and 206.6MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-20 11:07:45,098 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.29ms. Allocated memory is still 142.6MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1721.08ms. Allocated memory is still 201.3MB. Free memory was 159.3MB in the beginning and 133.1MB in the end (delta: 26.2MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 129.46ms. Allocated memory is still 201.3MB. Free memory was 133.0MB in the beginning and 128.1MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 126.42ms. Allocated memory is still 201.3MB. Free memory was 128.1MB in the beginning and 123.7MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1346.43ms. Allocated memory is still 201.3MB. Free memory was 123.7MB in the beginning and 126.6MB in the end (delta: -2.9MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * TraceAbstraction took 18143.68ms. Allocated memory was 201.3MB in the beginning and 459.3MB in the end (delta: 257.9MB). Free memory was 126.6MB in the beginning and 226.6MB in the end (delta: -99.9MB). Peak memory consumption was 157.0MB. Max. memory is 16.1GB. * Witness Printer took 153.52ms. Allocated memory is still 459.3MB. Free memory was 226.6MB in the beginning and 206.6MB in the end (delta: 19.9MB). 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: [L5343] int LDV_IN_INTERRUPT = 1; [L5344] struct sk_buff *proto_group0 ; [L5345] int ref_cnt ; [L5346] int ldv_state_variable_1 ; [L5347] struct net_device *proto_group1 ; [L5348] int ldv_state_variable_0 ; [L5564-L5566] static struct hdlc_proto proto = {& x25_open, & x25_close, 0, 0, 0, & x25_ioctl, 0, & x25_rx, & x25_xmit, & __this_module, 0}; [L5633] int ldv_retval_0 ; [L5634] int ldv_retval_1 ; [L5837] Element set_impl[15] ; [L5838] int last_index = 0; [L5972] Set LDV_SKBS ; 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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set={8:0}, set={0:0}, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={0:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, result=3, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, reason=0, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, result=3, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, result=3, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8: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={7:0}, proto_group0={-18446744073709551615:0}, proto_group1={-3:0}, ref_cnt=0, set_impl={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 238 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.9s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6728 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6622 mSDsluCounter, 9644 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7484 mSDsCounter, 2413 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6531 IncrementalHoareTripleChecker+Invalid, 8944 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2413 mSolverCounterUnsat, 2160 mSDtfsCounter, 6531 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.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 4068 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 969 NumberOfCodeBlocks, 969 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 807 ConstructedInterpolants, 0 QuantifiedInterpolants, 1755 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-20 11:07:45,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a7b9904-5ea6-47df-975b-b91ecbba03f9/bin/uautomizer-ug76WZFUDN/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