./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_ppp.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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/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_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/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_ppp.ko-entry_point.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/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_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/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 790ee47547867d006f1299e2cf5c9d6d26b057091574ae3950813e98f75c3c5e --- 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 10:57:14,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:57:14,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:57:14,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:57:14,430 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:57:14,431 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:57:14,432 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:57:14,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:57:14,436 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:57:14,437 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:57:14,438 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:57:14,439 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:57:14,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:57:14,440 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:57:14,441 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:57:14,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:57:14,443 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:57:14,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:57:14,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:57:14,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:57:14,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:57:14,451 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:57:14,452 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:57:14,453 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:57:14,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:57:14,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:57:14,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:57:14,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:57:14,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:57:14,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:57:14,461 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:57:14,461 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:57:14,462 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:57:14,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:57:14,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:57:14,465 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:57:14,465 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:57:14,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:57:14,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:57:14,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:57:14,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:57:14,477 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-20 10:57:14,535 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:57:14,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:57:14,536 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:57:14,536 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:57:14,537 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:57:14,537 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:57:14,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:57:14,538 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:57:14,539 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:57:14,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:57:14,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:57:14,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:57:14,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:57:14,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:57:14,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:57:14,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:57:14,540 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:57:14,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:57:14,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:57:14,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:57:14,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:57:14,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:57:14,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:57:14,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:57:14,542 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:57:14,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:57:14,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:57:14,543 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:57:14,543 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:57:14,544 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:57:14,544 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_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/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_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/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 -> 790ee47547867d006f1299e2cf5c9d6d26b057091574ae3950813e98f75c3c5e [2022-11-20 10:57:14,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:57:14,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:57:14,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:57:14,896 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:57:14,896 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:57:14,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/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_ppp.ko-entry_point.cil.out.i [2022-11-20 10:57:18,131 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:57:18,752 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:57:18,753 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_ppp.ko-entry_point.cil.out.i [2022-11-20 10:57:18,791 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/bin/uautomizer-ug76WZFUDN/data/dfe290b43/9bce0b5a807d4ac89729869f0611aeed/FLAGe02c54052 [2022-11-20 10:57:18,812 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/bin/uautomizer-ug76WZFUDN/data/dfe290b43/9bce0b5a807d4ac89729869f0611aeed [2022-11-20 10:57:18,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:57:18,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:57:18,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:57:18,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:57:18,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:57:18,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:57:18" (1/1) ... [2022-11-20 10:57:18,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5178d0c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:18, skipping insertion in model container [2022-11-20 10:57:18,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:57:18" (1/1) ... [2022-11-20 10:57:18,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:57:18,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:57:19,805 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_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_ppp.ko-entry_point.cil.out.i[152029,152042] [2022-11-20 10:57:20,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:57:20,253 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:57:20,423 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_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_ppp.ko-entry_point.cil.out.i[152029,152042] [2022-11-20 10:57:20,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:57:20,673 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:57:20,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:20 WrapperNode [2022-11-20 10:57:20,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:57:20,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:57:20,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:57:20,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:57:20,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:20" (1/1) ... [2022-11-20 10:57:20,766 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:20" (1/1) ... [2022-11-20 10:57:20,848 INFO L138 Inliner]: procedures = 134, calls = 555, calls flagged for inlining = 53, calls inlined = 50, statements flattened = 1647 [2022-11-20 10:57:20,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:57:20,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:57:20,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:57:20,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:57:20,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:20" (1/1) ... [2022-11-20 10:57:20,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:20" (1/1) ... [2022-11-20 10:57:20,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:20" (1/1) ... [2022-11-20 10:57:20,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:20" (1/1) ... [2022-11-20 10:57:20,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:20" (1/1) ... [2022-11-20 10:57:20,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:20" (1/1) ... [2022-11-20 10:57:20,945 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:20" (1/1) ... [2022-11-20 10:57:20,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:20" (1/1) ... [2022-11-20 10:57:20,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:57:20,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:57:20,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:57:20,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:57:20,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:20" (1/1) ... [2022-11-20 10:57:20,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:57:21,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:57:21,039 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:57:21,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:57:21,095 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_hard_header [2022-11-20 10:57:21,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_hard_header [2022-11-20 10:57:21,095 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-11-20 10:57:21,096 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-11-20 10:57:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_rx [2022-11-20 10:57:21,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_rx [2022-11-20 10:57:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-20 10:57:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_type_trans [2022-11-20 10:57:21,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_type_trans [2022-11-20 10:57:21,098 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-11-20 10:57:21,098 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-11-20 10:57:21,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-20 10:57:21,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-20 10:57:21,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-20 10:57:21,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-20 10:57:21,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:57:21,100 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-11-20 10:57:21,100 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-11-20 10:57:21,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-20 10:57:21,101 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-20 10:57:21,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_disconnect_3 [2022-11-20 10:57:21,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_disconnect_3 [2022-11-20 10:57:21,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-20 10:57:21,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-20 10:57:21,102 INFO L130 BoogieDeclarations]: Found specification of procedure netif_dormant_on [2022-11-20 10:57:21,102 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_dormant_on [2022-11-20 10:57:21,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-11-20 10:57:21,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-11-20 10:57:21,103 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-20 10:57:21,103 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-20 10:57:21,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:57:21,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-11-20 10:57:21,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-11-20 10:57:21,104 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_tx_flush [2022-11-20 10:57:21,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_tx_flush [2022-11-20 10:57:21,105 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-11-20 10:57:21,105 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-11-20 10:57:21,106 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-20 10:57:21,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-20 10:57:21,107 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-20 10:57:21,107 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-20 10:57:21,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:57:21,107 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-20 10:57:21,108 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-20 10:57:21,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:57:21,108 INFO L130 BoogieDeclarations]: Found specification of procedure get_ppp [2022-11-20 10:57:21,108 INFO L138 BoogieDeclarations]: Found implementation of procedure get_ppp [2022-11-20 10:57:21,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:57:21,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 10:57:21,109 INFO L130 BoogieDeclarations]: Found specification of procedure get_proto [2022-11-20 10:57:21,109 INFO L138 BoogieDeclarations]: Found implementation of procedure get_proto [2022-11-20 10:57:21,109 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-20 10:57:21,110 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-11-20 10:57:21,110 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-11-20 10:57:21,110 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_tx_cp [2022-11-20 10:57:21,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_tx_cp [2022-11-20 10:57:21,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 10:57:21,112 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-11-20 10:57:21,112 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-11-20 10:57:21,112 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-11-20 10:57:21,113 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-11-20 10:57:21,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:57:21,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 10:57:21,114 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_cp_event [2022-11-20 10:57:21,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_cp_event [2022-11-20 10:57:21,115 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-11-20 10:57:21,115 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-11-20 10:57:21,115 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-11-20 10:57:21,115 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-11-20 10:57:21,116 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-11-20 10:57:21,116 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-11-20 10:57:21,116 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_ioctl [2022-11-20 10:57:21,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ppp_ioctl [2022-11-20 10:57:21,116 INFO L130 BoogieDeclarations]: Found specification of procedure proto_name [2022-11-20 10:57:21,117 INFO L138 BoogieDeclarations]: Found implementation of procedure proto_name [2022-11-20 10:57:21,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:57:21,117 INFO L130 BoogieDeclarations]: Found specification of procedure linkwatch_fire_event [2022-11-20 10:57:21,117 INFO L138 BoogieDeclarations]: Found implementation of procedure linkwatch_fire_event [2022-11-20 10:57:21,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-20 10:57:21,118 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-20 10:57:21,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-20 10:57:21,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:57:21,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:57:21,696 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:57:21,713 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:57:22,524 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-20 10:57:23,520 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:57:23,539 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:57:23,539 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 10:57:23,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:57:23 BoogieIcfgContainer [2022-11-20 10:57:23,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:57:23,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:57:23,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:57:23,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:57:23,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:57:18" (1/3) ... [2022-11-20 10:57:23,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d279db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:57:23, skipping insertion in model container [2022-11-20 10:57:23,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:57:20" (2/3) ... [2022-11-20 10:57:23,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d279db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:57:23, skipping insertion in model container [2022-11-20 10:57:23,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:57:23" (3/3) ... [2022-11-20 10:57:23,552 INFO L112 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_ppp.ko-entry_point.cil.out.i [2022-11-20 10:57:23,573 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:57:23,573 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 10:57:23,650 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:57:23,657 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;@735bb56e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:57:23,657 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 10:57:23,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 593 states, 433 states have (on average 1.4133949191685913) internal successors, (612), 454 states have internal predecessors, (612), 126 states have call successors, (126), 33 states have call predecessors, (126), 32 states have return successors, (122), 115 states have call predecessors, (122), 122 states have call successors, (122) [2022-11-20 10:57:23,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-20 10:57:23,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:23,678 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:57:23,679 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:23,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:23,685 INFO L85 PathProgramCache]: Analyzing trace with hash 461964592, now seen corresponding path program 1 times [2022-11-20 10:57:23,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:23,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728737069] [2022-11-20 10:57:23,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:23,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:24,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:57:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:24,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:57:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:24,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 10:57:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:24,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:57:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:24,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 10:57:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-20 10:57:24,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:24,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728737069] [2022-11-20 10:57:24,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728737069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:24,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:24,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 10:57:24,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279457979] [2022-11-20 10:57:24,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:24,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:57:24,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:24,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:57:24,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:57:24,466 INFO L87 Difference]: Start difference. First operand has 593 states, 433 states have (on average 1.4133949191685913) internal successors, (612), 454 states have internal predecessors, (612), 126 states have call successors, (126), 33 states have call predecessors, (126), 32 states have return successors, (122), 115 states have call predecessors, (122), 122 states have call successors, (122) Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-20 10:57:27,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:27,439 INFO L93 Difference]: Finished difference Result 1924 states and 3013 transitions. [2022-11-20 10:57:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:57:27,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-11-20 10:57:27,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:27,491 INFO L225 Difference]: With dead ends: 1924 [2022-11-20 10:57:27,491 INFO L226 Difference]: Without dead ends: 1316 [2022-11-20 10:57:27,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:57:27,527 INFO L413 NwaCegarLoop]: 902 mSDtfsCounter, 1195 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:27,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 2116 Invalid, 1008 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [321 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-20 10:57:27,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2022-11-20 10:57:27,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1124. [2022-11-20 10:57:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 827 states have (on average 1.4014510278113663) internal successors, (1159), 857 states have internal predecessors, (1159), 234 states have call successors, (234), 63 states have call predecessors, (234), 62 states have return successors, (233), 219 states have call predecessors, (233), 233 states have call successors, (233) [2022-11-20 10:57:27,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1626 transitions. [2022-11-20 10:57:27,760 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1626 transitions. Word has length 47 [2022-11-20 10:57:27,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:27,761 INFO L495 AbstractCegarLoop]: Abstraction has 1124 states and 1626 transitions. [2022-11-20 10:57:27,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-11-20 10:57:27,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1626 transitions. [2022-11-20 10:57:27,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-20 10:57:27,767 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:27,767 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:57:27,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:57:27,768 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:27,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:27,769 INFO L85 PathProgramCache]: Analyzing trace with hash -203116028, now seen corresponding path program 1 times [2022-11-20 10:57:27,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:27,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471077803] [2022-11-20 10:57:27,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:27,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:28,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:57:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:28,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:57:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:28,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 10:57:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:28,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:57:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:28,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 10:57:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:28,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 10:57:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:28,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 10:57:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:28,108 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-20 10:57:28,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:28,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471077803] [2022-11-20 10:57:28,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471077803] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:28,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:28,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:57:28,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862043019] [2022-11-20 10:57:28,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:28,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:57:28,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:28,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:57:28,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:57:28,115 INFO L87 Difference]: Start difference. First operand 1124 states and 1626 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-20 10:57:30,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:30,229 INFO L93 Difference]: Finished difference Result 2425 states and 3576 transitions. [2022-11-20 10:57:30,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:57:30,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-11-20 10:57:30,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:30,247 INFO L225 Difference]: With dead ends: 2425 [2022-11-20 10:57:30,248 INFO L226 Difference]: Without dead ends: 1315 [2022-11-20 10:57:30,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:57:30,264 INFO L413 NwaCegarLoop]: 951 mSDtfsCounter, 1230 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 2261 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:30,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 2261 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-20 10:57:30,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2022-11-20 10:57:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1123. [2022-11-20 10:57:30,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 826 states have (on average 1.3983050847457628) internal successors, (1155), 856 states have internal predecessors, (1155), 234 states have call successors, (234), 63 states have call predecessors, (234), 62 states have return successors, (233), 219 states have call predecessors, (233), 233 states have call successors, (233) [2022-11-20 10:57:30,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1622 transitions. [2022-11-20 10:57:30,441 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1622 transitions. Word has length 62 [2022-11-20 10:57:30,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:30,442 INFO L495 AbstractCegarLoop]: Abstraction has 1123 states and 1622 transitions. [2022-11-20 10:57:30,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-20 10:57:30,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1622 transitions. [2022-11-20 10:57:30,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-20 10:57:30,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:30,456 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:30,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:57:30,457 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:30,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:30,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1442675309, now seen corresponding path program 1 times [2022-11-20 10:57:30,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:30,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362173764] [2022-11-20 10:57:30,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:30,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:30,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:57:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:30,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:57:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:30,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 10:57:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:30,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:57:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:30,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 10:57:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:30,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 10:57:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:30,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 10:57:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:30,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 10:57:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:31,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 10:57:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-11-20 10:57:31,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:31,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362173764] [2022-11-20 10:57:31,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362173764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:31,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:31,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:57:31,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880173155] [2022-11-20 10:57:31,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:31,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:57:31,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:31,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:57:31,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:57:31,038 INFO L87 Difference]: Start difference. First operand 1123 states and 1622 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-20 10:57:33,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:33,986 INFO L93 Difference]: Finished difference Result 3722 states and 5707 transitions. [2022-11-20 10:57:33,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:57:33,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2022-11-20 10:57:33,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:34,021 INFO L225 Difference]: With dead ends: 3722 [2022-11-20 10:57:34,021 INFO L226 Difference]: Without dead ends: 2608 [2022-11-20 10:57:34,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:57:34,075 INFO L413 NwaCegarLoop]: 861 mSDtfsCounter, 1231 mSDsluCounter, 2809 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 3670 SdHoareTripleChecker+Invalid, 1582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:34,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 3670 Invalid, 1582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-20 10:57:34,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2022-11-20 10:57:34,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 2370. [2022-11-20 10:57:34,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2370 states, 1755 states have (on average 1.4062678062678062) internal successors, (2468), 1821 states have internal predecessors, (2468), 478 states have call successors, (478), 125 states have call predecessors, (478), 136 states have return successors, (599), 455 states have call predecessors, (599), 477 states have call successors, (599) [2022-11-20 10:57:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 3545 transitions. [2022-11-20 10:57:34,341 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 3545 transitions. Word has length 83 [2022-11-20 10:57:34,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:34,342 INFO L495 AbstractCegarLoop]: Abstraction has 2370 states and 3545 transitions. [2022-11-20 10:57:34,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-20 10:57:34,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 3545 transitions. [2022-11-20 10:57:34,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-20 10:57:34,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:34,356 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:34,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:57:34,361 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:34,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:34,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1545482870, now seen corresponding path program 1 times [2022-11-20 10:57:34,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:34,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567670847] [2022-11-20 10:57:34,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:34,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:34,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:57:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:34,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:57:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:34,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 10:57:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:34,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:57:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:34,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 10:57:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:34,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 10:57:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:34,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:57:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:34,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:57:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:34,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-20 10:57:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:34,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 10:57:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:34,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-11-20 10:57:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:34,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-20 10:57:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:34,704 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-11-20 10:57:34,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:34,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567670847] [2022-11-20 10:57:34,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567670847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:34,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:34,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:57:34,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816970963] [2022-11-20 10:57:34,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:34,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:57:34,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:34,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:57:34,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:57:34,710 INFO L87 Difference]: Start difference. First operand 2370 states and 3545 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-20 10:57:37,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:37,115 INFO L93 Difference]: Finished difference Result 4998 states and 7343 transitions. [2022-11-20 10:57:37,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:57:37,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2022-11-20 10:57:37,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:37,146 INFO L225 Difference]: With dead ends: 4998 [2022-11-20 10:57:37,147 INFO L226 Difference]: Without dead ends: 2642 [2022-11-20 10:57:37,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:57:37,173 INFO L413 NwaCegarLoop]: 822 mSDtfsCounter, 991 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:37,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 1906 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-20 10:57:37,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2022-11-20 10:57:37,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 2411. [2022-11-20 10:57:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 1782 states have (on average 1.361391694725028) internal successors, (2426), 1849 states have internal predecessors, (2426), 454 states have call successors, (454), 163 states have call predecessors, (454), 174 states have return successors, (561), 442 states have call predecessors, (561), 453 states have call successors, (561) [2022-11-20 10:57:37,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 3441 transitions. [2022-11-20 10:57:37,421 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 3441 transitions. Word has length 119 [2022-11-20 10:57:37,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:37,422 INFO L495 AbstractCegarLoop]: Abstraction has 2411 states and 3441 transitions. [2022-11-20 10:57:37,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-20 10:57:37,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 3441 transitions. [2022-11-20 10:57:37,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-20 10:57:37,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:37,435 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:37,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:57:37,436 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:37,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:37,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1893256586, now seen corresponding path program 2 times [2022-11-20 10:57:37,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:37,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931425176] [2022-11-20 10:57:37,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:37,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:37,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:57:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:37,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:57:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:37,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 10:57:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:37,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:57:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:37,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 10:57:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:37,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 10:57:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:37,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 10:57:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:37,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 10:57:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:37,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 10:57:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:37,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 10:57:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:37,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:57:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:37,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:57:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:37,780 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-20 10:57:37,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:37,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931425176] [2022-11-20 10:57:37,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931425176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:37,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:37,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:57:37,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482213954] [2022-11-20 10:57:37,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:37,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:57:37,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:37,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:57:37,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:57:37,784 INFO L87 Difference]: Start difference. First operand 2411 states and 3441 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-20 10:57:41,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:41,406 INFO L93 Difference]: Finished difference Result 5630 states and 8219 transitions. [2022-11-20 10:57:41,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:57:41,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 119 [2022-11-20 10:57:41,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:41,482 INFO L225 Difference]: With dead ends: 5630 [2022-11-20 10:57:41,482 INFO L226 Difference]: Without dead ends: 3820 [2022-11-20 10:57:41,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:57:41,497 INFO L413 NwaCegarLoop]: 1072 mSDtfsCounter, 1000 mSDsluCounter, 1795 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 2867 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:41,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 2867 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-20 10:57:41,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2022-11-20 10:57:41,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3462. [2022-11-20 10:57:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3462 states, 2581 states have (on average 1.3684618364974817) internal successors, (3532), 2681 states have internal predecessors, (3532), 640 states have call successors, (640), 223 states have call predecessors, (640), 240 states have return successors, (793), 617 states have call predecessors, (793), 639 states have call successors, (793) [2022-11-20 10:57:41,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 4965 transitions. [2022-11-20 10:57:41,793 INFO L78 Accepts]: Start accepts. Automaton has 3462 states and 4965 transitions. Word has length 119 [2022-11-20 10:57:41,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:41,794 INFO L495 AbstractCegarLoop]: Abstraction has 3462 states and 4965 transitions. [2022-11-20 10:57:41,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-11-20 10:57:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 4965 transitions. [2022-11-20 10:57:41,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-20 10:57:41,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:41,804 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:41,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:57:41,804 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:41,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:41,805 INFO L85 PathProgramCache]: Analyzing trace with hash 528219514, now seen corresponding path program 1 times [2022-11-20 10:57:41,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:41,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364216362] [2022-11-20 10:57:41,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:41,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:41,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:57:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:41,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:57:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:41,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 10:57:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:41,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:57:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:41,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 10:57:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:42,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 10:57:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:42,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 10:57:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:42,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 10:57:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:42,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 10:57:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:42,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-20 10:57:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:42,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:57:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:42,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:57:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-11-20 10:57:42,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:42,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364216362] [2022-11-20 10:57:42,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364216362] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:42,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:42,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 10:57:42,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962631320] [2022-11-20 10:57:42,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:42,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:57:42,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:42,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:57:42,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:57:42,075 INFO L87 Difference]: Start difference. First operand 3462 states and 4965 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-20 10:57:45,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:45,040 INFO L93 Difference]: Finished difference Result 7855 states and 11473 transitions. [2022-11-20 10:57:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:57:45,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 136 [2022-11-20 10:57:45,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:45,084 INFO L225 Difference]: With dead ends: 7855 [2022-11-20 10:57:45,084 INFO L226 Difference]: Without dead ends: 4994 [2022-11-20 10:57:45,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 10:57:45,101 INFO L413 NwaCegarLoop]: 1295 mSDtfsCounter, 1098 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 2617 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:45,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 2617 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-20 10:57:45,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4994 states. [2022-11-20 10:57:45,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4994 to 4517. [2022-11-20 10:57:45,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4517 states, 3382 states have (on average 1.3719692489651094) internal successors, (4640), 3515 states have internal predecessors, (4640), 826 states have call successors, (826), 285 states have call predecessors, (826), 308 states have return successors, (1025), 792 states have call predecessors, (1025), 825 states have call successors, (1025) [2022-11-20 10:57:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4517 states to 4517 states and 6491 transitions. [2022-11-20 10:57:45,443 INFO L78 Accepts]: Start accepts. Automaton has 4517 states and 6491 transitions. Word has length 136 [2022-11-20 10:57:45,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:45,444 INFO L495 AbstractCegarLoop]: Abstraction has 4517 states and 6491 transitions. [2022-11-20 10:57:45,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-20 10:57:45,445 INFO L276 IsEmpty]: Start isEmpty. Operand 4517 states and 6491 transitions. [2022-11-20 10:57:45,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-20 10:57:45,453 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:45,453 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:45,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:57:45,454 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:45,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:45,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1586883258, now seen corresponding path program 1 times [2022-11-20 10:57:45,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:45,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121172847] [2022-11-20 10:57:45,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:45,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:45,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:57:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:45,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:57:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:45,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 10:57:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:45,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:57:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:45,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 10:57:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:45,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:57:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:45,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:57:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:45,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-20 10:57:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:45,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 10:57:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:45,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-20 10:57:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:45,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 10:57:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:46,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:57:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:46,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:57:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:46,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 10:57:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:46,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-20 10:57:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:46,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-20 10:57:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:46,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-20 10:57:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-20 10:57:46,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:46,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121172847] [2022-11-20 10:57:46,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121172847] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:57:46,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354334114] [2022-11-20 10:57:46,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:46,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:57:46,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:57:46,290 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:57:46,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:57:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:46,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 1258 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 10:57:46,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:57:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-11-20 10:57:46,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:57:46,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354334114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:46,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:57:46,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-20 10:57:46,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74126629] [2022-11-20 10:57:46,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:46,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:57:46,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:46,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:57:46,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:57:46,835 INFO L87 Difference]: Start difference. First operand 4517 states and 6491 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-20 10:57:47,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:47,321 INFO L93 Difference]: Finished difference Result 9714 states and 14031 transitions. [2022-11-20 10:57:47,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:57:47,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 147 [2022-11-20 10:57:47,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:47,366 INFO L225 Difference]: With dead ends: 9714 [2022-11-20 10:57:47,366 INFO L226 Difference]: Without dead ends: 5211 [2022-11-20 10:57:47,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:57:47,388 INFO L413 NwaCegarLoop]: 1037 mSDtfsCounter, 167 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:47,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1869 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:57:47,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5211 states. [2022-11-20 10:57:47,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5211 to 4577. [2022-11-20 10:57:47,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4577 states, 3442 states have (on average 1.3654851830331203) internal successors, (4700), 3575 states have internal predecessors, (4700), 826 states have call successors, (826), 285 states have call predecessors, (826), 308 states have return successors, (1025), 792 states have call predecessors, (1025), 825 states have call successors, (1025) [2022-11-20 10:57:47,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 6551 transitions. [2022-11-20 10:57:47,790 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 6551 transitions. Word has length 147 [2022-11-20 10:57:47,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:47,791 INFO L495 AbstractCegarLoop]: Abstraction has 4577 states and 6551 transitions. [2022-11-20 10:57:47,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-20 10:57:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 6551 transitions. [2022-11-20 10:57:47,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-20 10:57:47,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:47,806 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:47,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:57:48,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:57:48,016 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:48,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:48,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2106356288, now seen corresponding path program 1 times [2022-11-20 10:57:48,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:48,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883563621] [2022-11-20 10:57:48,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:48,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:57:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:57:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 10:57:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:57:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 10:57:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-20 10:57:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:57:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-20 10:57:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-20 10:57:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-20 10:57:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 10:57:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:57:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:57:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-20 10:57:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-11-20 10:57:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-20 10:57:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-20 10:57:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-20 10:57:48,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:48,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883563621] [2022-11-20 10:57:48,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883563621] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:57:48,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557849879] [2022-11-20 10:57:48,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:48,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:57:48,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:57:48,753 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:57:48,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:57:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:49,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 1258 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-20 10:57:49,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:57:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-11-20 10:57:49,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:57:49,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557849879] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:49,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:57:49,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-20 10:57:49,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791251105] [2022-11-20 10:57:49,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:49,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 10:57:49,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:49,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 10:57:49,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:57:49,328 INFO L87 Difference]: Start difference. First operand 4577 states and 6551 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-20 10:57:49,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:49,726 INFO L93 Difference]: Finished difference Result 9150 states and 13556 transitions. [2022-11-20 10:57:49,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 10:57:49,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 147 [2022-11-20 10:57:49,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:49,762 INFO L225 Difference]: With dead ends: 9150 [2022-11-20 10:57:49,762 INFO L226 Difference]: Without dead ends: 4587 [2022-11-20 10:57:49,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 180 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:57:49,791 INFO L413 NwaCegarLoop]: 833 mSDtfsCounter, 2 mSDsluCounter, 2486 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3319 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:49,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3319 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 10:57:49,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4587 states. [2022-11-20 10:57:50,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4587 to 4577. [2022-11-20 10:57:50,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4577 states, 3432 states have (on average 1.3607226107226107) internal successors, (4670), 3570 states have internal predecessors, (4670), 826 states have call successors, (826), 285 states have call predecessors, (826), 318 states have return successors, (1052), 797 states have call predecessors, (1052), 825 states have call successors, (1052) [2022-11-20 10:57:50,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 6548 transitions. [2022-11-20 10:57:50,139 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 6548 transitions. Word has length 147 [2022-11-20 10:57:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:50,139 INFO L495 AbstractCegarLoop]: Abstraction has 4577 states and 6548 transitions. [2022-11-20 10:57:50,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-20 10:57:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 6548 transitions. [2022-11-20 10:57:50,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-20 10:57:50,152 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:50,152 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:50,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 10:57:50,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:57:50,367 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:50,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:50,367 INFO L85 PathProgramCache]: Analyzing trace with hash 852351328, now seen corresponding path program 1 times [2022-11-20 10:57:50,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:50,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436621725] [2022-11-20 10:57:50,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:50,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:51,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:57:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:51,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-20 10:57:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:51,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-20 10:57:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:51,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-20 10:57:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:51,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-20 10:57:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:51,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-20 10:57:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:51,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 10:57:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:51,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-20 10:57:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:51,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-20 10:57:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:51,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-20 10:57:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:51,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:57:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:51,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-11-20 10:57:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:51,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-20 10:57:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:51,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-20 10:57:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:51,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-20 10:57:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:52,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 10:57:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:52,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 10:57:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:52,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:57:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:57:52,949 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-11-20 10:57:52,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:57:52,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436621725] [2022-11-20 10:57:52,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436621725] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:57:52,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:57:52,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-20 10:57:52,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806924514] [2022-11-20 10:57:52,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:57:52,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 10:57:52,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:57:52,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 10:57:52,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:57:52,954 INFO L87 Difference]: Start difference. First operand 4577 states and 6548 transitions. Second operand has 16 states, 15 states have (on average 6.333333333333333) internal successors, (95), 11 states have internal predecessors, (95), 3 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (18), 5 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-20 10:57:59,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:57:59,262 INFO L93 Difference]: Finished difference Result 9629 states and 14338 transitions. [2022-11-20 10:57:59,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 10:57:59,263 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.333333333333333) internal successors, (95), 11 states have internal predecessors, (95), 3 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (18), 5 states have call predecessors, (18), 2 states have call successors, (18) Word has length 154 [2022-11-20 10:57:59,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:57:59,315 INFO L225 Difference]: With dead ends: 9629 [2022-11-20 10:57:59,315 INFO L226 Difference]: Without dead ends: 5066 [2022-11-20 10:57:59,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2022-11-20 10:57:59,352 INFO L413 NwaCegarLoop]: 780 mSDtfsCounter, 213 mSDsluCounter, 8745 mSDsCounter, 0 mSdLazyCounter, 3201 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 9525 SdHoareTripleChecker+Invalid, 3338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 3201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-20 10:57:59,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 9525 Invalid, 3338 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [137 Valid, 3201 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-11-20 10:57:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5066 states. [2022-11-20 10:57:59,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5066 to 4607. [2022-11-20 10:57:59,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4607 states, 3462 states have (on average 1.3547082611207395) internal successors, (4690), 3590 states have internal predecessors, (4690), 826 states have call successors, (826), 285 states have call predecessors, (826), 318 states have return successors, (1047), 807 states have call predecessors, (1047), 825 states have call successors, (1047) [2022-11-20 10:57:59,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4607 states to 4607 states and 6563 transitions. [2022-11-20 10:57:59,730 INFO L78 Accepts]: Start accepts. Automaton has 4607 states and 6563 transitions. Word has length 154 [2022-11-20 10:57:59,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:57:59,731 INFO L495 AbstractCegarLoop]: Abstraction has 4607 states and 6563 transitions. [2022-11-20 10:57:59,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.333333333333333) internal successors, (95), 11 states have internal predecessors, (95), 3 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (18), 5 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-20 10:57:59,731 INFO L276 IsEmpty]: Start isEmpty. Operand 4607 states and 6563 transitions. [2022-11-20 10:57:59,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-11-20 10:57:59,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:57:59,747 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:57:59,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:57:59,748 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 10:57:59,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:57:59,748 INFO L85 PathProgramCache]: Analyzing trace with hash -145558883, now seen corresponding path program 1 times [2022-11-20 10:57:59,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:57:59,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645001221] [2022-11-20 10:57:59,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:57:59,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:57:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:57:59,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 10:57:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 10:58:00,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 10:58:00,205 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 10:58:00,206 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 10:58:00,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:58:00,212 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:58:00,219 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:58:00,298 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-20 10:58:00,299 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-20 10:58:00,300 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-20 10:58:00,300 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-20 10:58:00,301 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-20 10:58:00,301 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-20 10:58:00,301 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-20 10:58:00,301 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-20 10:58:00,302 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-20 10:58:00,302 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-20 10:58:00,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:58:00 BoogieIcfgContainer [2022-11-20 10:58:00,477 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:58:00,477 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:58:00,477 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:58:00,478 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:58:00,478 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:57:23" (3/4) ... [2022-11-20 10:58:00,480 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-20 10:58:00,512 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-20 10:58:00,512 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-20 10:58:00,512 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-20 10:58:00,512 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-20 10:58:00,513 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-20 10:58:00,513 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-20 10:58:00,513 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-20 10:58:00,514 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-20 10:58:00,514 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-20 10:58:00,514 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-20 10:58:00,731 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:58:00,731 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:58:00,732 INFO L158 Benchmark]: Toolchain (without parser) took 41915.46ms. Allocated memory was 163.6MB in the beginning and 643.8MB in the end (delta: 480.2MB). Free memory was 126.9MB in the beginning and 428.6MB in the end (delta: -301.7MB). Peak memory consumption was 177.1MB. Max. memory is 16.1GB. [2022-11-20 10:58:00,732 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 130.0MB. Free memory was 96.9MB in the beginning and 96.8MB in the end (delta: 77.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:58:00,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1854.85ms. Allocated memory was 163.6MB in the beginning and 211.8MB in the end (delta: 48.2MB). Free memory was 126.9MB in the beginning and 159.0MB in the end (delta: -32.1MB). Peak memory consumption was 78.6MB. Max. memory is 16.1GB. [2022-11-20 10:58:00,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 170.89ms. Allocated memory is still 211.8MB. Free memory was 159.0MB in the beginning and 148.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 10:58:00,733 INFO L158 Benchmark]: Boogie Preprocessor took 125.74ms. Allocated memory is still 211.8MB. Free memory was 148.5MB in the beginning and 138.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 10:58:00,734 INFO L158 Benchmark]: RCFGBuilder took 2566.46ms. Allocated memory is still 211.8MB. Free memory was 138.0MB in the beginning and 133.9MB in the end (delta: 4.1MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. [2022-11-20 10:58:00,734 INFO L158 Benchmark]: TraceAbstraction took 36931.99ms. Allocated memory was 211.8MB in the beginning and 643.8MB in the end (delta: 432.0MB). Free memory was 132.9MB in the beginning and 467.4MB in the end (delta: -334.5MB). Peak memory consumption was 428.9MB. Max. memory is 16.1GB. [2022-11-20 10:58:00,735 INFO L158 Benchmark]: Witness Printer took 253.85ms. Allocated memory is still 643.8MB. Free memory was 467.4MB in the beginning and 428.6MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-20 10:58:00,737 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 130.0MB. Free memory was 96.9MB in the beginning and 96.8MB in the end (delta: 77.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1854.85ms. Allocated memory was 163.6MB in the beginning and 211.8MB in the end (delta: 48.2MB). Free memory was 126.9MB in the beginning and 159.0MB in the end (delta: -32.1MB). Peak memory consumption was 78.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 170.89ms. Allocated memory is still 211.8MB. Free memory was 159.0MB in the beginning and 148.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.74ms. Allocated memory is still 211.8MB. Free memory was 148.5MB in the beginning and 138.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 2566.46ms. Allocated memory is still 211.8MB. Free memory was 138.0MB in the beginning and 133.9MB in the end (delta: 4.1MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. * TraceAbstraction took 36931.99ms. Allocated memory was 211.8MB in the beginning and 643.8MB in the end (delta: 432.0MB). Free memory was 132.9MB in the beginning and 467.4MB in the end (delta: -334.5MB). Peak memory consumption was 428.9MB. Max. memory is 16.1GB. * Witness Printer took 253.85ms. Allocated memory is still 643.8MB. Free memory was 467.4MB in the beginning and 428.6MB in the end (delta: 38.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled * 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: 5283]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L5306] int LDV_IN_INTERRUPT = 1; [L5307] struct net_device *proto_group1 ; [L5308] int ldv_state_variable_0 ; [L5309] int ldv_state_variable_3 ; [L5310] int ldv_timer_state_1 = 0; [L5311] int ldv_state_variable_2 ; [L5312] struct sk_buff *proto_group0 ; [L5313] int ref_cnt ; [L5314] int ldv_state_variable_1 ; [L5315] struct timer_list *ldv_timer_list_1 ; [L5374] static struct sk_buff_head tx_queue ; [L5543-L5569] static int cp_table[13U][7U] = { { 163, 16, 16, 16, 16, 16, 16}, { 16, 0, 0, 0, 0, 0, 0}, { 16, 16, 1026, 131, 131, 133, 16}, { 16, 16, 1, 1, 1, 1, 16}, { 2048, 421, 2, 261, 262, 261, 389}, { 2048, 675, 2, 515, 516, 515, 643}, { 2048, 2049, 2, 36, 131, 6, 131}, { 2048, 2049, 2, 163, 131, 165, 131}, { 2048, 2049, 2050, 2051, 2051, 2051, 2114}, { 0, 1, 1, 3, 3, 5, 131}, { 4096, 4097, 4098, 4099, 4100, 4101, 4102}, { 0, 1, 2, 3, 3, 5, 6}, { 0, 1, 1, 1, 1, 1, 1058}}; [L6005-L6007] static struct hdlc_proto proto = {0, & ppp_close, & ppp_start, & ppp_stop, 0, & ppp_ioctl, & ppp_type_trans, & ppp_rx, 0, & __this_module, 0}; [L6008] static struct header_ops const ppp_header_ops = {& ppp_hard_header, 0, 0, 0, 0}; [L6088] int ldv_retval_0 ; [L6508] Element set_impl[15] ; [L6509] int last_index = 0; [L6643] Set LDV_SKBS ; VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6156] struct ifreq *ldvarg0 ; [L6157] void *tmp ; [L6158] unsigned int ldvarg1 ; [L6159] unsigned int tmp___0 ; [L6160] unsigned short ldvarg4 ; [L6161] unsigned short tmp___1 ; [L6162] struct sk_buff *ldvarg3 ; [L6163] void *tmp___2 ; [L6164] struct net_device *ldvarg5 ; [L6165] void *tmp___3 ; [L6166] void *ldvarg2 ; [L6167] void *tmp___4 ; [L6168] void *ldvarg6 ; [L6169] void *tmp___5 ; [L6170] int tmp___6 ; [L6171] int tmp___7 ; [L6172] int tmp___8 ; [L6173] int tmp___9 ; VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6175] CALL, EXPR ldv_zalloc(40UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5248] void *p ; [L5249] void *tmp ; [L5250] int tmp___0 ; [L5252] tmp___0 = __VERIFIER_nondet_int() [L5253] COND TRUE tmp___0 != 0 [L5254] return ((void *)0); VAL [\old(size)=40, \result={0:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=40, tmp___0=1, tx_queue={12:0}] [L6175] RET, EXPR ldv_zalloc(40UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(40UL)={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6175] tmp = ldv_zalloc(40UL) [L6176] ldvarg0 = (struct ifreq *)tmp [L6177] tmp___0 = __VERIFIER_nondet_uint() [L6178] ldvarg1 = tmp___0 [L6179] tmp___1 = __VERIFIER_nondet_ushort() [L6180] ldvarg4 = tmp___1 VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=5, ldvarg4=10, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tx_queue={12:0}] [L6181] CALL, EXPR ldv_zalloc(232UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5248] void *p ; [L5249] void *tmp ; [L5250] int tmp___0 ; [L5252] tmp___0 = __VERIFIER_nondet_int() [L5253] COND TRUE tmp___0 != 0 [L5254] return ((void *)0); VAL [\old(size)=232, \result={0:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=232, tmp___0=1, tx_queue={12:0}] [L6181] RET, EXPR ldv_zalloc(232UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(232UL)={0:0}, ldvarg0={0:0}, ldvarg1=5, ldvarg4=10, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tx_queue={12:0}] [L6181] tmp___2 = ldv_zalloc(232UL) [L6182] ldvarg3 = (struct sk_buff *)tmp___2 VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=5, ldvarg3={0:0}, ldvarg4=10, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tx_queue={12:0}] [L6183] CALL, EXPR ldv_zalloc(3264UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5248] void *p ; [L5249] void *tmp ; [L5250] int tmp___0 ; [L5252] tmp___0 = __VERIFIER_nondet_int() [L5253] COND TRUE tmp___0 != 0 [L5254] return ((void *)0); VAL [\old(size)=3264, \result={0:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=3264, tmp___0=1, tx_queue={12:0}] [L6183] RET, EXPR ldv_zalloc(3264UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(3264UL)={0:0}, ldvarg0={0:0}, ldvarg1=5, ldvarg3={0:0}, ldvarg4=10, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tx_queue={12:0}] [L6183] tmp___3 = ldv_zalloc(3264UL) [L6184] ldvarg5 = (struct net_device *)tmp___3 VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=5, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tx_queue={12:0}] [L6185] CALL, EXPR ldv_zalloc(1UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5248] void *p ; [L5249] void *tmp ; [L5250] int tmp___0 ; [L5252] tmp___0 = __VERIFIER_nondet_int() [L5253] COND TRUE tmp___0 != 0 [L5254] return ((void *)0); VAL [\old(size)=1, \result={0:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=1, tmp___0=1, tx_queue={12:0}] [L6185] RET, EXPR ldv_zalloc(1UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(1UL)={0:0}, ldvarg0={0:0}, ldvarg1=5, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tx_queue={12:0}] [L6185] tmp___4 = ldv_zalloc(1UL) [L6186] ldvarg2 = tmp___4 VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=5, ldvarg2={0:0}, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tmp___4={0:0}, tx_queue={12:0}] [L6187] CALL, EXPR ldv_zalloc(1UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5248] void *p ; [L5249] void *tmp ; [L5250] int tmp___0 ; [L5252] tmp___0 = __VERIFIER_nondet_int() [L5253] COND TRUE tmp___0 != 0 [L5254] return ((void *)0); VAL [\old(size)=1, \result={0:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=1, tmp___0=1, tx_queue={12:0}] [L6187] RET, EXPR ldv_zalloc(1UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(1UL)={0:0}, ldvarg0={0:0}, ldvarg1=5, ldvarg2={0:0}, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tmp___4={0:0}, tx_queue={12:0}] [L6187] tmp___5 = ldv_zalloc(1UL) [L6188] ldvarg6 = tmp___5 [L6189] CALL ldv_initialize() [L6662] CALL ldv_set_init(LDV_SKBS) [L6514] set = set_impl [L6515] last_index = 0 VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set={0:0}, set={16:0}, set_impl={16:0}, tx_queue={12:0}] [L6662] RET ldv_set_init(LDV_SKBS) [L6189] RET ldv_initialize() [L6190] ldv_state_variable_1 = 1 [L6191] ref_cnt = 0 [L6192] ldv_state_variable_0 = 1 [L6193] ldv_state_variable_3 = 0 [L6194] ldv_state_variable_2 = 0 VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=5, ldvarg2={0:0}, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ldvarg6={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tx_queue={12:0}] [L6196] tmp___6 = __VERIFIER_nondet_int() [L6198] case 0: [L6204] case 1: VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=5, ldvarg2={0:0}, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ldvarg6={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=1, tx_queue={12:0}] [L6205] COND TRUE ldv_state_variable_0 != 0 [L6206] tmp___7 = __VERIFIER_nondet_int() [L6208] case 0: [L6216] case 1: VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=5, ldvarg2={0:0}, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ldvarg6={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=1, tmp___7=1, tx_queue={12:0}] [L6217] COND TRUE ldv_state_variable_0 == 1 [L6218] CALL, EXPR mod_init() [L6076] CALL skb_queue_head_init(& tx_queue) [L5188] struct lock_class_key __key ; VAL [__key={17:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, list={12:0}, list={12:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5190] CALL spinlock_check(& list->lock) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, lock={12:20}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5137] return (& lock->ldv_6338.rlock); VAL [\result={12:20}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, lock={12:20}, lock={12:20}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5190] RET spinlock_check(& list->lock) VAL [__key={17:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, list={12:0}, list={12:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, spinlock_check(& list->lock)={12:20}, tx_queue={12:0}] [L5191] FCALL __raw_spin_lock_init(& list->lock.ldv_6338.rlock, "&(&list->lock)->rlock", & __key) VAL [__key={17:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, list={12:0}, list={12:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5192] CALL __skb_queue_head_init(list) [L5177] struct sk_buff *tmp ; [L5179] tmp = (struct sk_buff *)list [L5180] list->next = tmp [L5181] list->prev = tmp [L5182] list->qlen = 0U VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, list={12:0}, list={12:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={12:0}, tx_queue={12:0}] [L5192] RET __skb_queue_head_init(list) [L5193] return; VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, list={12:0}, list={12:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6076] RET skb_queue_head_init(& tx_queue) [L6077] FCALL register_hdlc_protocol(& proto) [L6078] return (0); VAL [\result=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, ldv_state_variable_3=0, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6218] RET, EXPR mod_init() [L6218] ldv_retval_0 = mod_init() [L6219] COND TRUE ldv_retval_0 == 0 [L6220] ldv_state_variable_0 = 3 [L6221] ldv_state_variable_2 = 1 [L6222] ldv_state_variable_3 = 1 [L6223] CALL ldv_initialize_hdlc_proto_3() [L6115] void *tmp ; [L6116] void *tmp___0 ; VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6118] CALL, EXPR ldv_zalloc(3264UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5248] void *p ; [L5249] void *tmp ; [L5250] int tmp___0 ; [L5252] tmp___0 = __VERIFIER_nondet_int() [L5253] COND TRUE tmp___0 != 0 [L5254] return ((void *)0); VAL [\old(size)=3264, \result={0:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=3264, tmp___0=1, tx_queue={12:0}] [L6118] RET, EXPR ldv_zalloc(3264UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(3264UL)={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6118] tmp = ldv_zalloc(3264UL) [L6119] proto_group1 = (struct net_device *)tmp VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tx_queue={12:0}] [L6120] CALL, EXPR ldv_zalloc(232UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5248] void *p ; [L5249] void *tmp ; [L5250] int tmp___0 ; [L5252] tmp___0 = __VERIFIER_nondet_int() [L5253] COND TRUE tmp___0 != 0 [L5254] return ((void *)0); VAL [\old(size)=232, \result={0:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=232, tmp___0=1, tx_queue={12:0}] [L6120] RET, EXPR ldv_zalloc(232UL) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(232UL)={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tx_queue={12:0}] [L6120] tmp___0 = ldv_zalloc(232UL) [L6121] proto_group0 = (struct sk_buff *)tmp___0 VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0={0:0}, tx_queue={12:0}] [L6223] RET ldv_initialize_hdlc_proto_3() [L6226] COND FALSE !(ldv_retval_0 != 0) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=5, ldvarg2={0:0}, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ldvarg6={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=1, tmp___7=1, tx_queue={12:0}] [L6196] tmp___6 = __VERIFIER_nondet_int() [L6198] case 0: VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldvarg0={0:0}, ldvarg1=5, ldvarg2={0:0}, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ldvarg6={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=0, tmp___7=1, tx_queue={12:0}] [L6199] COND TRUE ldv_state_variable_1 != 0 [L6200] CALL choose_timer_1(ldv_timer_list_1) [L6128] LDV_IN_INTERRUPT = 2 [L6129] EXPR timer->data [L6129] EXPR timer->function [L6129] CALL (*(timer->function))(timer->data) [L5913] struct proto *proto___0 ; [L5914] struct ppp *ppp ; [L5915] struct ppp *tmp ; [L5916] unsigned long flags ; [L5917] raw_spinlock_t *tmp___0 ; [L5919] proto___0 = (struct proto *)arg [L5920] EXPR proto___0->dev VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, arg=18446744073709551613, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto___0->dev={18446744073709551619:-3264}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5920] CALL, EXPR get_ppp(proto___0->dev) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, dev={18446744073709551619:-3264}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5378] struct hdlc_device *tmp ; VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, dev={18446744073709551619:-3264}, dev={18446744073709551619:-3264}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5380] CALL, EXPR dev_to_hdlc(dev) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, dev={18446744073709551619:-3264}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5367] void *tmp ; [L5369] CALL, EXPR netdev_priv((struct net_device const *)dev) [L5324] return ((void *)dev + 3264U); VAL [\result={18446744073709551619:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, dev={18446744073709551619:-3264}, dev={18446744073709551619:-3264}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5369] RET, EXPR netdev_priv((struct net_device const *)dev) [L5369] tmp = netdev_priv((struct net_device const *)dev) [L5370] return ((struct hdlc_device *)tmp); VAL [\result={18446744073709551619:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, dev={18446744073709551619:-3264}, dev={18446744073709551619:-3264}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={18446744073709551619:0}, tx_queue={12:0}] [L5380] RET, EXPR dev_to_hdlc(dev) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, dev={18446744073709551619:-3264}, dev={18446744073709551619:-3264}, dev_to_hdlc(dev)={18446744073709551619:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5380] tmp = dev_to_hdlc(dev) [L5381] EXPR tmp->state [L5381] return ((struct ppp *)tmp->state); [L5920] RET, EXPR get_ppp(proto___0->dev) VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, arg=18446744073709551613, cp_table={13:0}, get_ppp(proto___0->dev)={18446744073709551627:-435}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto___0->dev={18446744073709551619:-3264}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5920] tmp = get_ppp(proto___0->dev) [L5921] ppp = tmp VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, arg=18446744073709551613, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp={18446744073709551627:-435}, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={18446744073709551627:-435}, tx_queue={12:0}] [L5922] CALL, EXPR spinlock_check(& ppp->lock) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, lock={18446744073709551627:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5137] return (& lock->ldv_6338.rlock); VAL [\result={18446744073709551627:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, lock={18446744073709551627:0}, lock={18446744073709551627:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5922] RET, EXPR spinlock_check(& ppp->lock) VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, arg=18446744073709551613, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp={18446744073709551627:-435}, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, spinlock_check(& ppp->lock)={18446744073709551627:0}, tmp={18446744073709551627:-435}, tx_queue={12:0}] [L5922] tmp___0 = spinlock_check(& ppp->lock) [L5923] CALL, EXPR _raw_spin_lock_irqsave(tmp___0) VAL [__this_module={18446744073709551625:18446744073709551615}, arg0={18446744073709551627:0}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6731] return __VERIFIER_nondet_ulong(); [L5923] RET, EXPR _raw_spin_lock_irqsave(tmp___0) VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, _raw_spin_lock_irqsave(tmp___0)=18446744073709551614, arg=18446744073709551613, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp={18446744073709551627:-435}, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={18446744073709551627:-435}, tmp___0={18446744073709551627:0}, tx_queue={12:0}] [L5923] flags = _raw_spin_lock_irqsave(tmp___0) [L5924] proto___0->state [L5925] case 2: VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, arg=18446744073709551613, cp_table={13:0}, flags=18446744073709551614, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp={18446744073709551627:-435}, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto___0->state=-250, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={18446744073709551627:-435}, tmp___0={18446744073709551627:0}, tx_queue={12:0}] [L5926] case 3: VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, arg=18446744073709551613, cp_table={13:0}, flags=18446744073709551614, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp={18446744073709551627:-435}, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto___0->state=-250, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={18446744073709551627:-435}, tmp___0={18446744073709551627:0}, tx_queue={12:0}] [L5927] case 4: VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, arg=18446744073709551613, cp_table={13:0}, flags=18446744073709551614, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp={18446744073709551627:-435}, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto___0->state=-250, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={18446744073709551627:-435}, tmp___0={18446744073709551627:0}, tx_queue={12:0}] [L5928] case 5: [L5936] case 6: [L5937] EXPR proto___0->pid VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, arg=18446744073709551613, cp_table={13:0}, flags=18446744073709551614, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp={18446744073709551627:-435}, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto___0->pid=18, proto___0->state=-250, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={18446744073709551627:-435}, tmp___0={18446744073709551627:0}, tx_queue={12:0}] [L5937] COND TRUE (unsigned int )proto___0->pid != 49185U [L5955] CALL spin_unlock_irqrestore(& ppp->lock, flags) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5143] FCALL _raw_spin_unlock_irqrestore(& lock->ldv_6338.rlock, flags) [L5955] RET spin_unlock_irqrestore(& ppp->lock, flags) VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, arg=18446744073709551613, cp_table={13:0}, flags=18446744073709551614, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp={18446744073709551627:-435}, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto___0->state=-250, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={18446744073709551627:-435}, tmp___0={18446744073709551627:0}, tx_queue={12:0}] [L5956] CALL ppp_tx_flush() VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5475] struct sk_buff *skb ; VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5481] CALL, EXPR ldv_skb_dequeue_12(& tx_queue) [L6460] struct sk_buff *tmp ; VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, ldv_func_arg1={12:0}, ldv_func_arg1={12:0}, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6462] CALL, EXPR ldv_skb_alloc() VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6646] void *skb ; [L6647] void *tmp___7 ; VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6649] CALL, EXPR ldv_zalloc(sizeof(struct sk_buff___0 )) VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5248] void *p ; [L5249] void *tmp ; [L5250] int tmp___0 ; [L5252] tmp___0 = __VERIFIER_nondet_int() [L5253] COND FALSE !(tmp___0 != 0) [L5256] EXPR, FCALL calloc(1UL, size) [L5256] tmp = calloc(1UL, size) [L5257] p = tmp VAL [\old(last_index)=0, \old(size)=248, __this_module={18446744073709551625:18446744073709551615}, calloc(1UL, size)={-18446744073709551617:0}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, p={-18446744073709551617:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=248, tmp={-18446744073709551617:0}, tmp___0=0, tx_queue={12:0}] [L5258] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, \old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5227] COND FALSE !(!cond) VAL [\old(cond)=1, \old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cond=1, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5258] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(last_index)=0, \old(size)=248, __this_module={18446744073709551625:18446744073709551615}, calloc(1UL, size)={-18446744073709551617:0}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, p={-18446744073709551617:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=248, tmp={-18446744073709551617:0}, tmp___0=0, tx_queue={12:0}] [L5259] return (p); VAL [\old(last_index)=0, \old(size)=248, \result={-18446744073709551617:0}, __this_module={18446744073709551625:18446744073709551615}, calloc(1UL, size)={-18446744073709551617:0}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, p={-18446744073709551617:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=248, tmp={-18446744073709551617:0}, tmp___0=0, tx_queue={12:0}] [L6649] RET, EXPR ldv_zalloc(sizeof(struct sk_buff___0 )) VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(sizeof(struct sk_buff___0 ))={-18446744073709551617:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6649] tmp___7 = ldv_zalloc(sizeof(struct sk_buff___0 )) [L6650] skb = (struct sk_buff___0 *)tmp___7 VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, skb={-18446744073709551617:0}, tmp___7={-18446744073709551617:0}, tx_queue={12:0}] [L6651] COND FALSE !(! skb) [L6654] CALL ldv_set_add(LDV_SKBS, skb) [L6522] int i ; [L6524] i = 0 VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, e={-18446744073709551617:0}, e={-18446744073709551617:0}, i=0, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={16:0}, tx_queue={12:0}] [L6525] COND TRUE 1 VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, e={-18446744073709551617:0}, e={-18446744073709551617:0}, i=0, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={16:0}, tx_queue={12:0}] [L6526] COND FALSE !(i < last_index) VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, e={-18446744073709551617:0}, e={-18446744073709551617:0}, i=0, last_index=0, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={16:0}, tx_queue={12:0}] [L6536] COND TRUE last_index < 15 [L6537] set_impl[last_index] = e [L6538] last_index = last_index + 1 VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, e={-18446744073709551617:0}, e={-18446744073709551617:0}, i=0, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={16:0}, tx_queue={12:0}] [L6654] RET ldv_set_add(LDV_SKBS, skb) [L6655] return (skb); VAL [\old(last_index)=0, \result={-18446744073709551617:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, skb={-18446744073709551617:0}, tmp___7={-18446744073709551617:0}, tx_queue={12:0}] [L6462] RET, EXPR ldv_skb_alloc() VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, ldv_func_arg1={12:0}, ldv_func_arg1={12:0}, LDV_IN_INTERRUPT=2, ldv_retval_0=0, ldv_skb_alloc()={-18446744073709551617:0}, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6462] tmp = ldv_skb_alloc() [L6463] return (tmp); VAL [\old(last_index)=0, \result={-18446744073709551617:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, ldv_func_arg1={12:0}, ldv_func_arg1={12:0}, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={-18446744073709551617:0}, tx_queue={12:0}] [L5481] RET, EXPR ldv_skb_dequeue_12(& tx_queue) [L5481] skb = ldv_skb_dequeue_12(& tx_queue) [L5482] COND TRUE (unsigned long )skb != (unsigned long )((struct sk_buff *)0) VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, skb={-18446744073709551617:0}, tx_queue={12:0}] [L5479] CALL dev_queue_xmit(skb) [L6753] return __VERIFIER_nondet_int(); [L5479] RET dev_queue_xmit(skb) [L5481] CALL, EXPR ldv_skb_dequeue_12(& tx_queue) [L6460] struct sk_buff *tmp ; VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, ldv_func_arg1={12:0}, ldv_func_arg1={12:0}, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6462] CALL, EXPR ldv_skb_alloc() VAL [\old(last_index)=1, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6646] void *skb ; [L6647] void *tmp___7 ; VAL [\old(last_index)=1, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6649] CALL, EXPR ldv_zalloc(sizeof(struct sk_buff___0 )) VAL [\old(last_index)=1, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5248] void *p ; [L5249] void *tmp ; [L5250] int tmp___0 ; [L5252] tmp___0 = __VERIFIER_nondet_int() [L5253] COND TRUE tmp___0 != 0 [L5254] return ((void *)0); VAL [\old(last_index)=1, \old(size)=248, \result={0:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, size=248, tmp___0=1, tx_queue={12:0}] [L6649] RET, EXPR ldv_zalloc(sizeof(struct sk_buff___0 )) VAL [\old(last_index)=1, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ldv_zalloc(sizeof(struct sk_buff___0 ))={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6649] tmp___7 = ldv_zalloc(sizeof(struct sk_buff___0 )) [L6650] skb = (struct sk_buff___0 *)tmp___7 VAL [\old(last_index)=1, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, skb={0:0}, tmp___7={0:0}, tx_queue={12:0}] [L6651] COND TRUE ! skb [L6652] return ((void *)0); VAL [\old(last_index)=1, \result={0:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, skb={0:0}, tmp___7={0:0}, tx_queue={12:0}] [L6462] RET, EXPR ldv_skb_alloc() VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, ldv_func_arg1={12:0}, ldv_func_arg1={12:0}, LDV_IN_INTERRUPT=2, ldv_retval_0=0, ldv_skb_alloc()={0:0}, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L6462] tmp = ldv_skb_alloc() [L6463] return (tmp); VAL [\old(last_index)=0, \result={0:0}, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, ldv_func_arg1={12:0}, ldv_func_arg1={12:0}, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tx_queue={12:0}] [L5481] RET, EXPR ldv_skb_dequeue_12(& tx_queue) [L5481] skb = ldv_skb_dequeue_12(& tx_queue) [L5482] COND FALSE !((unsigned long )skb != (unsigned long )((struct sk_buff *)0)) VAL [\old(last_index)=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, skb={0:0}, tx_queue={12:0}] [L5956] RET ppp_tx_flush() VAL [\old(arg)=18446744073709551613, __this_module={18446744073709551625:18446744073709551615}, arg=18446744073709551613, cp_table={13:0}, flags=18446744073709551614, last_index=1, LDV_IN_INTERRUPT=2, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=0, ppp={18446744073709551627:-435}, ppp_header_ops={15:0}, proto={14:0}, proto___0={0:-3}, proto___0->state=-250, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={18446744073709551627:-435}, tmp___0={18446744073709551627:0}, tx_queue={12:0}] [L6129] RET (*(timer->function))(timer->data) [L6130] LDV_IN_INTERRUPT = 1 [L6131] ldv_timer_state_1 = 2 VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=2, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, timer={0:0}, timer={0:0}, tx_queue={12:0}] [L6200] RET choose_timer_1(ldv_timer_list_1) [L6196] tmp___6 = __VERIFIER_nondet_int() [L6198] case 0: [L6204] case 1: VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=2, ldvarg0={0:0}, ldvarg1=5, ldvarg2={0:0}, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ldvarg6={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=1, tmp___7=1, tx_queue={12:0}] [L6205] COND TRUE ldv_state_variable_0 != 0 [L6206] tmp___7 = __VERIFIER_nondet_int() [L6208] case 0: VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=2, ldvarg0={0:0}, ldvarg1=5, ldvarg2={0:0}, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ldvarg6={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=1, tmp___7=0, tx_queue={12:0}] [L6209] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L6210] CALL mod_exit() [L6084] FCALL unregister_hdlc_protocol(& proto) [L6210] RET mod_exit() [L6211] ldv_state_variable_0 = 2 VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=2, ldvarg0={0:0}, ldvarg1=5, ldvarg2={0:0}, ldvarg3={0:0}, ldvarg4=10, ldvarg5={0:0}, ldvarg6={0:0}, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp={0:0}, tmp___0=5, tmp___1=10, tmp___2={0:0}, tmp___3={0:0}, tmp___4={0:0}, tmp___5={0:0}, tmp___6=1, tmp___7=0, tx_queue={12:0}] [L6419] CALL ldv_check_final_state() [L6713] int tmp___7 ; [L6715] CALL, EXPR ldv_set_is_empty(LDV_SKBS) [L6604] return (last_index == 0); VAL [\result=0, __this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=2, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set={0:0}, set={0:0}, set_impl={16:0}, tx_queue={12:0}] [L6715] RET, EXPR ldv_set_is_empty(LDV_SKBS) [L6715] tmp___7 = ldv_set_is_empty(LDV_SKBS) [L6716] COND FALSE !(\read(tmp___7)) VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=2, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tmp___7=0, tx_queue={12:0}] [L6718] CALL ldv_error() VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=2, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] [L5283] reach_error() VAL [__this_module={18446744073709551625:18446744073709551615}, cp_table={13:0}, last_index=1, LDV_IN_INTERRUPT=1, ldv_retval_0=0, LDV_SKBS={0:0}, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_state_variable_3=1, ldv_timer_list_1={0:0}, ldv_timer_state_1=2, ppp_header_ops={15:0}, proto={14:0}, proto_group0={0:0}, proto_group1={0:0}, ref_cnt=0, set_impl={16:0}, tx_queue={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 34 procedures, 594 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.6s, OverallIterations: 10, TraceHistogramMax: 9, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 24.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7505 SdHoareTripleChecker+Valid, 20.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7127 mSDsluCounter, 30150 SdHoareTripleChecker+Invalid, 17.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21597 mSDsCounter, 2172 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8938 IncrementalHoareTripleChecker+Invalid, 11110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2172 mSolverCounterUnsat, 8553 mSDtfsCounter, 8938 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 586 GetRequests, 523 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4607occurred in iteration=9, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 2791 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1479 NumberOfCodeBlocks, 1479 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1297 ConstructedInterpolants, 0 QuantifiedInterpolants, 2626 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2516 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 1167/1175 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 10:58:00,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e4fa910-e676-4da8-a7a8-4a41cb5546c9/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