./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 21:01:22,618 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 21:01:22,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 21:01:22,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 21:01:22,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 21:01:22,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 21:01:22,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 21:01:22,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 21:01:22,681 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 21:01:22,688 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 21:01:22,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 21:01:22,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 21:01:22,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 21:01:22,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 21:01:22,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 21:01:22,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 21:01:22,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 21:01:22,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 21:01:22,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 21:01:22,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 21:01:22,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 21:01:22,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 21:01:22,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 21:01:22,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 21:01:22,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 21:01:22,710 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 21:01:22,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 21:01:22,712 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 21:01:22,712 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 21:01:22,713 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 21:01:22,714 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 21:01:22,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 21:01:22,716 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 21:01:22,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 21:01:22,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 21:01:22,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 21:01:22,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 21:01:22,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 21:01:22,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 21:01:22,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 21:01:22,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 21:01:22,731 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-18 21:01:22,782 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 21:01:22,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 21:01:22,783 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 21:01:22,783 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 21:01:22,784 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 21:01:22,784 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 21:01:22,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 21:01:22,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 21:01:22,786 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 21:01:22,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 21:01:22,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 21:01:22,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 21:01:22,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 21:01:22,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 21:01:22,793 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 21:01:22,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 21:01:22,794 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 21:01:22,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 21:01:22,794 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 21:01:22,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 21:01:22,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 21:01:22,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:01:22,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 21:01:22,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 21:01:22,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 21:01:22,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 21:01:22,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 21:01:22,798 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 21:01:22,798 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 21:01:22,799 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 21:01:22,799 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_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c [2022-11-18 21:01:23,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 21:01:23,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 21:01:23,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 21:01:23,179 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 21:01:23,180 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 21:01:23,181 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-11-18 21:01:23,276 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/data/90b629fc3/32e04aa44d0a42829fad7fab4fce00a3/FLAG71b50a37b [2022-11-18 21:01:24,341 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 21:01:24,344 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-11-18 21:01:24,409 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/data/90b629fc3/32e04aa44d0a42829fad7fab4fce00a3/FLAG71b50a37b [2022-11-18 21:01:24,426 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/data/90b629fc3/32e04aa44d0a42829fad7fab4fce00a3 [2022-11-18 21:01:24,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 21:01:24,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 21:01:24,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 21:01:24,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 21:01:24,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 21:01:24,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:01:24" (1/1) ... [2022-11-18 21:01:24,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@387999dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:24, skipping insertion in model container [2022-11-18 21:01:24,444 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:01:24" (1/1) ... [2022-11-18 21:01:24,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 21:01:24,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 21:01:26,107 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2022-11-18 21:01:26,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:01:26,252 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 21:01:26,591 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2022-11-18 21:01:26,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:01:27,184 INFO L208 MainTranslator]: Completed translation [2022-11-18 21:01:27,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:27 WrapperNode [2022-11-18 21:01:27,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 21:01:27,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 21:01:27,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 21:01:27,189 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 21:01:27,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:27" (1/1) ... [2022-11-18 21:01:27,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:27" (1/1) ... [2022-11-18 21:01:27,420 INFO L138 Inliner]: procedures = 142, calls = 839, calls flagged for inlining = 59, calls inlined = 40, statements flattened = 1671 [2022-11-18 21:01:27,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 21:01:27,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 21:01:27,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 21:01:27,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 21:01:27,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:27" (1/1) ... [2022-11-18 21:01:27,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:27" (1/1) ... [2022-11-18 21:01:27,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:27" (1/1) ... [2022-11-18 21:01:27,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:27" (1/1) ... [2022-11-18 21:01:27,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:27" (1/1) ... [2022-11-18 21:01:27,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:27" (1/1) ... [2022-11-18 21:01:27,584 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:27" (1/1) ... [2022-11-18 21:01:27,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:27" (1/1) ... [2022-11-18 21:01:27,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 21:01:27,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 21:01:27,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 21:01:27,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 21:01:27,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:27" (1/1) ... [2022-11-18 21:01:27,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:01:27,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:01:27,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 21:01:27,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 21:01:27,712 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-11-18 21:01:27,712 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-11-18 21:01:27,712 INFO L130 BoogieDeclarations]: Found specification of procedure catc_tx_run [2022-11-18 21:01:27,713 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_tx_run [2022-11-18 21:01:27,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-18 21:01:27,713 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-11-18 21:01:27,713 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-11-18 21:01:27,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-18 21:01:27,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-18 21:01:27,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 21:01:27,714 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-11-18 21:01:27,714 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-11-18 21:01:27,715 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-11-18 21:01:27,715 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-11-18 21:01:27,715 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_run [2022-11-18 21:01:27,715 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_run [2022-11-18 21:01:27,715 INFO L130 BoogieDeclarations]: Found specification of procedure catc_get_drvinfo [2022-11-18 21:01:27,716 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_get_drvinfo [2022-11-18 21:01:27,716 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_msg [2022-11-18 21:01:27,716 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_msg [2022-11-18 21:01:27,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-18 21:01:27,716 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-18 21:01:27,717 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-18 21:01:27,717 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-18 21:01:27,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-18 21:01:27,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-18 21:01:27,717 INFO L130 BoogieDeclarations]: Found specification of procedure catc_multicast [2022-11-18 21:01:27,718 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_multicast [2022-11-18 21:01:27,718 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-11-18 21:01:27,718 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-11-18 21:01:27,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 21:01:27,718 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-11-18 21:01:27,719 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-11-18 21:01:27,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-11-18 21:01:27,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-11-18 21:01:27,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-11-18 21:01:27,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-11-18 21:01:27,720 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-11-18 21:01:27,720 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-11-18 21:01:27,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-18 21:01:27,721 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-18 21:01:27,721 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-11-18 21:01:27,721 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-11-18 21:01:27,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 21:01:27,722 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2022-11-18 21:01:27,722 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2022-11-18 21:01:27,722 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-11-18 21:01:27,722 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-11-18 21:01:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-18 21:01:27,723 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-18 21:01:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 21:01:27,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 21:01:27,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 21:01:27,724 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_async [2022-11-18 21:01:27,725 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_async [2022-11-18 21:01:27,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 21:01:27,726 INFO L130 BoogieDeclarations]: Found specification of procedure catc_exit [2022-11-18 21:01:27,727 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_exit [2022-11-18 21:01:27,727 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-11-18 21:01:27,727 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-11-18 21:01:27,728 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-11-18 21:01:27,729 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-11-18 21:01:27,729 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-11-18 21:01:27,731 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-11-18 21:01:27,731 INFO L130 BoogieDeclarations]: Found specification of procedure catc_init [2022-11-18 21:01:27,731 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_init [2022-11-18 21:01:27,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-11-18 21:01:27,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-11-18 21:01:27,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 21:01:27,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 21:01:27,734 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-11-18 21:01:27,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-11-18 21:01:27,734 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-11-18 21:01:27,735 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-11-18 21:01:27,735 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-18 21:01:27,735 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-18 21:01:27,735 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-11-18 21:01:27,735 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-11-18 21:01:27,735 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-18 21:01:27,736 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-18 21:01:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-11-18 21:01:27,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-11-18 21:01:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 21:01:27,736 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-11-18 21:01:27,737 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-11-18 21:01:27,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-18 21:01:27,737 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-11-18 21:01:27,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 21:01:27,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 21:01:28,401 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 21:01:28,404 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 21:01:29,331 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-11-18 21:01:29,451 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-18 21:01:29,464 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-18 21:01:30,859 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2022-11-18 21:01:30,859 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2022-11-18 21:01:30,860 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-11-18 21:01:30,860 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-11-18 21:01:30,925 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 21:01:30,940 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 21:01:30,941 INFO L300 CfgBuilder]: Removed 30 assume(true) statements. [2022-11-18 21:01:30,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:01:30 BoogieIcfgContainer [2022-11-18 21:01:30,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 21:01:30,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 21:01:30,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 21:01:30,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 21:01:30,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:01:24" (1/3) ... [2022-11-18 21:01:30,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59db39e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:01:30, skipping insertion in model container [2022-11-18 21:01:30,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:01:27" (2/3) ... [2022-11-18 21:01:30,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59db39e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:01:30, skipping insertion in model container [2022-11-18 21:01:30,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:01:30" (3/3) ... [2022-11-18 21:01:30,956 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-11-18 21:01:30,981 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 21:01:30,981 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 21:01:31,081 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 21:01:31,096 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;@4b69b70f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 21:01:31,096 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 21:01:31,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 543 states, 384 states have (on average 1.3880208333333333) internal successors, (533), 397 states have internal predecessors, (533), 122 states have call successors, (122), 36 states have call predecessors, (122), 35 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) [2022-11-18 21:01:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 21:01:31,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:01:31,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:01:31,115 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:01:31,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:01:31,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1394595550, now seen corresponding path program 1 times [2022-11-18 21:01:31,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:01:31,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226962660] [2022-11-18 21:01:31,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:01:31,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:01:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:32,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:01:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:32,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:01:32,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:01:32,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226962660] [2022-11-18 21:01:32,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226962660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:01:32,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:01:32,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 21:01:32,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341370924] [2022-11-18 21:01:32,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:01:32,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 21:01:32,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:01:32,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 21:01:32,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 21:01:32,158 INFO L87 Difference]: Start difference. First operand has 543 states, 384 states have (on average 1.3880208333333333) internal successors, (533), 397 states have internal predecessors, (533), 122 states have call successors, (122), 36 states have call predecessors, (122), 35 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 21:01:32,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:01:32,461 INFO L93 Difference]: Finished difference Result 1084 states and 1594 transitions. [2022-11-18 21:01:32,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 21:01:32,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-18 21:01:32,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:01:32,491 INFO L225 Difference]: With dead ends: 1084 [2022-11-18 21:01:32,491 INFO L226 Difference]: Without dead ends: 544 [2022-11-18 21:01:32,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:01:32,510 INFO L413 NwaCegarLoop]: 716 mSDtfsCounter, 301 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 3175 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:01:32,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 3175 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 21:01:32,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-11-18 21:01:32,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 539. [2022-11-18 21:01:32,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 382 states have (on average 1.2225130890052356) internal successors, (467), 390 states have internal predecessors, (467), 121 states have call successors, (121), 35 states have call predecessors, (121), 35 states have return successors, (119), 118 states have call predecessors, (119), 118 states have call successors, (119) [2022-11-18 21:01:32,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 707 transitions. [2022-11-18 21:01:32,645 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 707 transitions. Word has length 17 [2022-11-18 21:01:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:01:32,646 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 707 transitions. [2022-11-18 21:01:32,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 21:01:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 707 transitions. [2022-11-18 21:01:32,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 21:01:32,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:01:32,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:01:32,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 21:01:32,648 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:01:32,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:01:32,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1001568540, now seen corresponding path program 1 times [2022-11-18 21:01:32,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:01:32,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936718468] [2022-11-18 21:01:32,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:01:32,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:01:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:32,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:01:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:32,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:01:32,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:01:32,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936718468] [2022-11-18 21:01:32,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936718468] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:01:32,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:01:32,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 21:01:32,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086011184] [2022-11-18 21:01:32,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:01:32,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 21:01:32,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:01:32,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 21:01:32,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:01:32,944 INFO L87 Difference]: Start difference. First operand 539 states and 707 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 21:01:33,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:01:33,079 INFO L93 Difference]: Finished difference Result 1577 states and 2093 transitions. [2022-11-18 21:01:33,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 21:01:33,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-18 21:01:33,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:01:33,089 INFO L225 Difference]: With dead ends: 1577 [2022-11-18 21:01:33,089 INFO L226 Difference]: Without dead ends: 1056 [2022-11-18 21:01:33,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:01:33,094 INFO L413 NwaCegarLoop]: 987 mSDtfsCounter, 690 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:01:33,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 1670 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 21:01:33,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2022-11-18 21:01:33,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1053. [2022-11-18 21:01:33,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 746 states have (on average 1.2225201072386058) internal successors, (912), 759 states have internal predecessors, (912), 238 states have call successors, (238), 68 states have call predecessors, (238), 68 states have return successors, (240), 234 states have call predecessors, (240), 235 states have call successors, (240) [2022-11-18 21:01:33,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1390 transitions. [2022-11-18 21:01:33,218 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1390 transitions. Word has length 17 [2022-11-18 21:01:33,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:01:33,219 INFO L495 AbstractCegarLoop]: Abstraction has 1053 states and 1390 transitions. [2022-11-18 21:01:33,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 21:01:33,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1390 transitions. [2022-11-18 21:01:33,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 21:01:33,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:01:33,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:01:33,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 21:01:33,221 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:01:33,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:01:33,222 INFO L85 PathProgramCache]: Analyzing trace with hash 983594194, now seen corresponding path program 1 times [2022-11-18 21:01:33,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:01:33,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918904955] [2022-11-18 21:01:33,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:01:33,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:01:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:33,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:01:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:01:33,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:01:33,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918904955] [2022-11-18 21:01:33,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918904955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:01:33,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:01:33,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 21:01:33,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208061145] [2022-11-18 21:01:33,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:01:33,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 21:01:33,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:01:33,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 21:01:33,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:01:33,479 INFO L87 Difference]: Start difference. First operand 1053 states and 1390 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 21:01:33,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:01:33,577 INFO L93 Difference]: Finished difference Result 1055 states and 1391 transitions. [2022-11-18 21:01:33,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 21:01:33,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-11-18 21:01:33,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:01:33,585 INFO L225 Difference]: With dead ends: 1055 [2022-11-18 21:01:33,585 INFO L226 Difference]: Without dead ends: 1044 [2022-11-18 21:01:33,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:01:33,593 INFO L413 NwaCegarLoop]: 700 mSDtfsCounter, 692 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:01:33,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 21:01:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2022-11-18 21:01:33,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1039. [2022-11-18 21:01:33,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 736 states have (on average 1.2173913043478262) internal successors, (896), 747 states have internal predecessors, (896), 236 states have call successors, (236), 67 states have call predecessors, (236), 66 states have return successors, (238), 232 states have call predecessors, (238), 234 states have call successors, (238) [2022-11-18 21:01:33,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1370 transitions. [2022-11-18 21:01:33,710 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1370 transitions. Word has length 18 [2022-11-18 21:01:33,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:01:33,710 INFO L495 AbstractCegarLoop]: Abstraction has 1039 states and 1370 transitions. [2022-11-18 21:01:33,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 21:01:33,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1370 transitions. [2022-11-18 21:01:33,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-18 21:01:33,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:01:33,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:01:33,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 21:01:33,728 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:01:33,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:01:33,729 INFO L85 PathProgramCache]: Analyzing trace with hash 2065165388, now seen corresponding path program 1 times [2022-11-18 21:01:33,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:01:33,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735080259] [2022-11-18 21:01:33,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:01:33,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:01:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:33,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:01:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:34,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 21:01:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:34,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-18 21:01:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:34,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:01:34,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:01:34,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735080259] [2022-11-18 21:01:34,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735080259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:01:34,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:01:34,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 21:01:34,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915417756] [2022-11-18 21:01:34,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:01:34,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:01:34,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:01:34,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:01:34,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:01:34,031 INFO L87 Difference]: Start difference. First operand 1039 states and 1370 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 21:01:36,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:01:36,562 INFO L93 Difference]: Finished difference Result 2387 states and 3220 transitions. [2022-11-18 21:01:36,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 21:01:36,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2022-11-18 21:01:36,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:01:36,575 INFO L225 Difference]: With dead ends: 2387 [2022-11-18 21:01:36,575 INFO L226 Difference]: Without dead ends: 1360 [2022-11-18 21:01:36,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:01:36,591 INFO L413 NwaCegarLoop]: 612 mSDtfsCounter, 441 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-18 21:01:36,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1238 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-18 21:01:36,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2022-11-18 21:01:36,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1338. [2022-11-18 21:01:36,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 953 states have (on average 1.2381951731374607) internal successors, (1180), 972 states have internal predecessors, (1180), 318 states have call successors, (318), 67 states have call predecessors, (318), 66 states have return successors, (320), 312 states have call predecessors, (320), 316 states have call successors, (320) [2022-11-18 21:01:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1818 transitions. [2022-11-18 21:01:36,721 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1818 transitions. Word has length 50 [2022-11-18 21:01:36,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:01:36,722 INFO L495 AbstractCegarLoop]: Abstraction has 1338 states and 1818 transitions. [2022-11-18 21:01:36,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 21:01:36,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1818 transitions. [2022-11-18 21:01:36,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-18 21:01:36,731 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:01:36,731 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-18 21:01:36,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 21:01:36,732 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:01:36,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:01:36,733 INFO L85 PathProgramCache]: Analyzing trace with hash 960452703, now seen corresponding path program 1 times [2022-11-18 21:01:36,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:01:36,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449778554] [2022-11-18 21:01:36,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:01:36,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:01:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:37,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:01:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:37,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-18 21:01:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:37,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 21:01:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:37,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-18 21:01:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:37,147 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:01:37,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:01:37,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449778554] [2022-11-18 21:01:37,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449778554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:01:37,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:01:37,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 21:01:37,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32795325] [2022-11-18 21:01:37,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:01:37,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 21:01:37,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:01:37,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 21:01:37,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 21:01:37,151 INFO L87 Difference]: Start difference. First operand 1338 states and 1818 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-18 21:01:39,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:01:39,801 INFO L93 Difference]: Finished difference Result 2703 states and 3678 transitions. [2022-11-18 21:01:39,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 21:01:39,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 72 [2022-11-18 21:01:39,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:01:39,811 INFO L225 Difference]: With dead ends: 2703 [2022-11-18 21:01:39,812 INFO L226 Difference]: Without dead ends: 1366 [2022-11-18 21:01:39,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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-18 21:01:39,818 INFO L413 NwaCegarLoop]: 512 mSDtfsCounter, 197 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-18 21:01:39,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1637 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-18 21:01:39,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2022-11-18 21:01:39,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1338. [2022-11-18 21:01:39,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 953 states have (on average 1.236096537250787) internal successors, (1178), 974 states have internal predecessors, (1178), 317 states have call successors, (317), 68 states have call predecessors, (317), 67 states have return successors, (317), 309 states have call predecessors, (317), 313 states have call successors, (317) [2022-11-18 21:01:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1812 transitions. [2022-11-18 21:01:39,919 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1812 transitions. Word has length 72 [2022-11-18 21:01:39,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:01:39,920 INFO L495 AbstractCegarLoop]: Abstraction has 1338 states and 1812 transitions. [2022-11-18 21:01:39,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-18 21:01:39,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1812 transitions. [2022-11-18 21:01:39,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-11-18 21:01:39,923 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:01:39,924 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-18 21:01:39,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 21:01:39,924 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:01:39,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:01:39,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1052870136, now seen corresponding path program 1 times [2022-11-18 21:01:39,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:01:39,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975725427] [2022-11-18 21:01:39,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:01:39,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:01:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:40,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:01:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:40,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 21:01:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:40,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 21:01:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:40,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 21:01:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:40,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 21:01:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:40,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 21:01:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:40,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:01:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:40,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:01:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:40,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:01:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:40,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:01:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:40,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:01:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:40,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:01:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:40,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:01:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:40,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 21:01:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:40,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:01:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:40,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:01:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:40,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 21:01:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:40,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:01:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:40,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:01:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:40,921 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-11-18 21:01:40,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:01:40,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975725427] [2022-11-18 21:01:40,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975725427] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:01:40,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442153477] [2022-11-18 21:01:40,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:01:40,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:01:40,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:01:40,931 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:01:40,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 21:01:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:41,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 1884 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 21:01:41,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:01:41,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-18 21:01:41,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-18 21:01:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-18 21:01:42,045 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:01:42,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442153477] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:01:42,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 21:01:42,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-11-18 21:01:42,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163215503] [2022-11-18 21:01:42,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:01:42,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:01:42,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:01:42,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:01:42,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-11-18 21:01:42,050 INFO L87 Difference]: Start difference. First operand 1338 states and 1812 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-18 21:01:44,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:01:44,230 INFO L93 Difference]: Finished difference Result 1400 states and 1892 transitions. [2022-11-18 21:01:44,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 21:01:44,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 146 [2022-11-18 21:01:44,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:01:44,245 INFO L225 Difference]: With dead ends: 1400 [2022-11-18 21:01:44,245 INFO L226 Difference]: Without dead ends: 1340 [2022-11-18 21:01:44,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-11-18 21:01:44,248 INFO L413 NwaCegarLoop]: 694 mSDtfsCounter, 4 mSDsluCounter, 3211 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3905 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:01:44,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3905 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-18 21:01:44,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2022-11-18 21:01:44,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1338. [2022-11-18 21:01:44,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 953 states have (on average 1.2339979013641134) internal successors, (1176), 974 states have internal predecessors, (1176), 317 states have call successors, (317), 68 states have call predecessors, (317), 67 states have return successors, (317), 309 states have call predecessors, (317), 313 states have call successors, (317) [2022-11-18 21:01:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1810 transitions. [2022-11-18 21:01:44,378 INFO L78 Accepts]: Start accepts. Automaton has 1338 states and 1810 transitions. Word has length 146 [2022-11-18 21:01:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:01:44,379 INFO L495 AbstractCegarLoop]: Abstraction has 1338 states and 1810 transitions. [2022-11-18 21:01:44,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-18 21:01:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1338 states and 1810 transitions. [2022-11-18 21:01:44,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-18 21:01:44,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:01:44,392 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-18 21:01:44,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 21:01:44,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:01:44,602 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:01:44,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:01:44,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2040585741, now seen corresponding path program 1 times [2022-11-18 21:01:44,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:01:44,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875419865] [2022-11-18 21:01:44,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:01:44,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:01:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:45,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:01:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:45,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 21:01:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:45,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 21:01:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:45,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 21:01:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:45,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 21:01:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:45,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 21:01:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:45,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:01:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:45,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:01:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:45,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:01:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:45,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:01:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:45,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:01:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:45,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:01:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:45,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:01:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:45,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 21:01:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:45,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:01:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:45,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:01:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:45,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 21:01:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:45,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:01:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:45,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:01:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-11-18 21:01:45,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:01:45,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875419865] [2022-11-18 21:01:45,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875419865] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:01:45,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794840472] [2022-11-18 21:01:45,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:01:45,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:01:45,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:01:45,370 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:01:45,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 21:01:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:46,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 1889 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-18 21:01:46,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:01:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-18 21:01:46,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:01:46,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794840472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:01:46,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 21:01:46,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-11-18 21:01:46,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972867913] [2022-11-18 21:01:46,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:01:46,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 21:01:46,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:01:46,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 21:01:46,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 21:01:46,213 INFO L87 Difference]: Start difference. First operand 1338 states and 1810 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-18 21:01:46,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:01:46,402 INFO L93 Difference]: Finished difference Result 2687 states and 3639 transitions. [2022-11-18 21:01:46,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 21:01:46,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 147 [2022-11-18 21:01:46,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:01:46,412 INFO L225 Difference]: With dead ends: 2687 [2022-11-18 21:01:46,412 INFO L226 Difference]: Without dead ends: 1359 [2022-11-18 21:01:46,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 182 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-18 21:01:46,419 INFO L413 NwaCegarLoop]: 710 mSDtfsCounter, 12 mSDsluCounter, 2807 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3517 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:01:46,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3517 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:01:46,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2022-11-18 21:01:46,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1345. [2022-11-18 21:01:46,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 958 states have (on average 1.232776617954071) internal successors, (1181), 980 states have internal predecessors, (1181), 317 states have call successors, (317), 68 states have call predecessors, (317), 69 states have return successors, (322), 310 states have call predecessors, (322), 313 states have call successors, (322) [2022-11-18 21:01:46,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1820 transitions. [2022-11-18 21:01:46,512 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1820 transitions. Word has length 147 [2022-11-18 21:01:46,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:01:46,512 INFO L495 AbstractCegarLoop]: Abstraction has 1345 states and 1820 transitions. [2022-11-18 21:01:46,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-18 21:01:46,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1820 transitions. [2022-11-18 21:01:46,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-18 21:01:46,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:01:46,517 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-18 21:01:46,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 21:01:46,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:01:46,734 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:01:46,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:01:46,735 INFO L85 PathProgramCache]: Analyzing trace with hash -273219476, now seen corresponding path program 1 times [2022-11-18 21:01:46,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:01:46,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891355740] [2022-11-18 21:01:46,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:01:46,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:01:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:48,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:01:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:48,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 21:01:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:48,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 21:01:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:48,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 21:01:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:48,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 21:01:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:48,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 21:01:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:48,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:01:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:48,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:01:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:48,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:01:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:48,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:01:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:48,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:01:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:48,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:01:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:48,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:01:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:48,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 21:01:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:48,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:01:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:48,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:01:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:48,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 21:01:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:48,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:01:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:48,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:01:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-18 21:01:48,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:01:48,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891355740] [2022-11-18 21:01:48,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891355740] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:01:48,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945752990] [2022-11-18 21:01:48,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:01:48,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:01:48,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:01:48,891 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:01:48,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 21:01:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:49,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-18 21:01:49,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:01:49,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 21:01:49,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 21:01:49,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 21:01:49,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 21:01:50,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 21:01:50,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 21:01:50,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-18 21:01:50,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-18 21:01:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-18 21:01:50,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:01:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-18 21:01:51,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945752990] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:01:51,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:01:51,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 8] total 19 [2022-11-18 21:01:51,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715511969] [2022-11-18 21:01:51,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:01:51,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-18 21:01:51,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:01:51,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 21:01:51,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-11-18 21:01:51,406 INFO L87 Difference]: Start difference. First operand 1345 states and 1820 transitions. Second operand has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 14 states have internal predecessors, (105), 8 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) [2022-11-18 21:01:59,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:01:59,064 INFO L93 Difference]: Finished difference Result 2454 states and 3312 transitions. [2022-11-18 21:01:59,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 21:01:59,065 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 14 states have internal predecessors, (105), 8 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) Word has length 147 [2022-11-18 21:01:59,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:01:59,072 INFO L225 Difference]: With dead ends: 2454 [2022-11-18 21:01:59,072 INFO L226 Difference]: Without dead ends: 1028 [2022-11-18 21:01:59,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 319 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-11-18 21:01:59,078 INFO L413 NwaCegarLoop]: 523 mSDtfsCounter, 345 mSDsluCounter, 3860 mSDsCounter, 0 mSdLazyCounter, 2495 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 4383 SdHoareTripleChecker+Invalid, 3594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 2495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 852 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-11-18 21:01:59,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 4383 Invalid, 3594 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [247 Valid, 2495 Invalid, 0 Unknown, 852 Unchecked, 7.3s Time] [2022-11-18 21:01:59,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2022-11-18 21:01:59,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1012. [2022-11-18 21:01:59,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 721 states have (on average 1.2288488210818307) internal successors, (886), 738 states have internal predecessors, (886), 226 states have call successors, (226), 63 states have call predecessors, (226), 64 states have return successors, (231), 221 states have call predecessors, (231), 224 states have call successors, (231) [2022-11-18 21:01:59,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1343 transitions. [2022-11-18 21:01:59,146 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1343 transitions. Word has length 147 [2022-11-18 21:01:59,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:01:59,147 INFO L495 AbstractCegarLoop]: Abstraction has 1012 states and 1343 transitions. [2022-11-18 21:01:59,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 14 states have internal predecessors, (105), 8 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) [2022-11-18 21:01:59,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1343 transitions. [2022-11-18 21:01:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-18 21:01:59,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:01:59,151 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:01:59,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 21:01:59,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-18 21:01:59,361 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:01:59,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:01:59,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1508280459, now seen corresponding path program 1 times [2022-11-18 21:01:59,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:01:59,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92134699] [2022-11-18 21:01:59,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:01:59,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:01:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:59,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:01:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:59,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 21:01:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:59,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 21:01:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:59,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 21:01:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:59,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 21:01:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:59,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 21:01:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:01:59,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:01:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:00,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:02:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:00,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:00,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:00,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:02:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:00,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:00,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:00,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 21:02:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:00,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:00,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:00,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 21:02:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:00,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:00,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-11-18 21:02:00,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:02:00,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92134699] [2022-11-18 21:02:00,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92134699] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:02:00,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203575429] [2022-11-18 21:02:00,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:02:00,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:02:00,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:02:00,431 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:02:00,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 21:02:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:01,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 1897 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-18 21:02:01,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:02:01,536 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-18 21:02:01,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:02:02,097 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-11-18 21:02:02,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203575429] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:02:02,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:02:02,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 16 [2022-11-18 21:02:02,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809176023] [2022-11-18 21:02:02,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:02:02,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-18 21:02:02,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:02:02,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-18 21:02:02,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-11-18 21:02:02,101 INFO L87 Difference]: Start difference. First operand 1012 states and 1343 transitions. Second operand has 16 states, 16 states have (on average 9.875) internal successors, (158), 12 states have internal predecessors, (158), 8 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (41), 9 states have call predecessors, (41), 8 states have call successors, (41) [2022-11-18 21:02:11,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:02:11,637 INFO L93 Difference]: Finished difference Result 2091 states and 2798 transitions. [2022-11-18 21:02:11,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 21:02:11,639 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.875) internal successors, (158), 12 states have internal predecessors, (158), 8 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (41), 9 states have call predecessors, (41), 8 states have call successors, (41) Word has length 147 [2022-11-18 21:02:11,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:02:11,647 INFO L225 Difference]: With dead ends: 2091 [2022-11-18 21:02:11,648 INFO L226 Difference]: Without dead ends: 1393 [2022-11-18 21:02:11,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 321 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=269, Invalid=853, Unknown=0, NotChecked=0, Total=1122 [2022-11-18 21:02:11,653 INFO L413 NwaCegarLoop]: 621 mSDtfsCounter, 1876 mSDsluCounter, 4394 mSDsCounter, 0 mSdLazyCounter, 4149 mSolverCounterSat, 884 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2007 SdHoareTripleChecker+Valid, 5015 SdHoareTripleChecker+Invalid, 5033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 884 IncrementalHoareTripleChecker+Valid, 4149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-11-18 21:02:11,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2007 Valid, 5015 Invalid, 5033 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [884 Valid, 4149 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2022-11-18 21:02:11,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2022-11-18 21:02:11,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1368. [2022-11-18 21:02:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 971 states have (on average 1.2245108135942326) internal successors, (1189), 993 states have internal predecessors, (1189), 302 states have call successors, (302), 92 states have call predecessors, (302), 94 states have return successors, (329), 297 states have call predecessors, (329), 300 states have call successors, (329) [2022-11-18 21:02:11,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1820 transitions. [2022-11-18 21:02:11,751 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1820 transitions. Word has length 147 [2022-11-18 21:02:11,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:02:11,752 INFO L495 AbstractCegarLoop]: Abstraction has 1368 states and 1820 transitions. [2022-11-18 21:02:11,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.875) internal successors, (158), 12 states have internal predecessors, (158), 8 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (41), 9 states have call predecessors, (41), 8 states have call successors, (41) [2022-11-18 21:02:11,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1820 transitions. [2022-11-18 21:02:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-18 21:02:11,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:02:11,756 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-11-18 21:02:11,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 21:02:11,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:02:11,962 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:02:11,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:02:11,962 INFO L85 PathProgramCache]: Analyzing trace with hash 783175115, now seen corresponding path program 1 times [2022-11-18 21:02:11,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:02:11,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174654710] [2022-11-18 21:02:11,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:02:11,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:02:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:12,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:02:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:12,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 21:02:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:12,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 21:02:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:12,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 21:02:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:12,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 21:02:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:12,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 21:02:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:12,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:02:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:12,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:02:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:12,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:12,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:12,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:02:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:12,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:12,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:12,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 21:02:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:12,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:12,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:12,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 21:02:12,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:12,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:12,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:12,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-11-18 21:02:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-18 21:02:12,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:02:12,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174654710] [2022-11-18 21:02:12,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174654710] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:02:12,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570817956] [2022-11-18 21:02:12,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:02:12,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:02:12,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:02:12,950 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:02:12,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 21:02:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:13,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 1930 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 21:02:13,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:02:13,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-18 21:02:13,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-18 21:02:13,918 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-18 21:02:13,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:02:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-18 21:02:14,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570817956] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 21:02:14,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-18 21:02:14,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2022-11-18 21:02:14,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149421416] [2022-11-18 21:02:14,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:02:14,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:02:14,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:02:14,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:02:14,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-18 21:02:14,120 INFO L87 Difference]: Start difference. First operand 1368 states and 1820 transitions. Second operand has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-18 21:02:15,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:02:15,436 INFO L93 Difference]: Finished difference Result 1433 states and 1898 transitions. [2022-11-18 21:02:15,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 21:02:15,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 157 [2022-11-18 21:02:15,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:02:15,445 INFO L225 Difference]: With dead ends: 1433 [2022-11-18 21:02:15,446 INFO L226 Difference]: Without dead ends: 1368 [2022-11-18 21:02:15,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 348 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-11-18 21:02:15,448 INFO L413 NwaCegarLoop]: 695 mSDtfsCounter, 6 mSDsluCounter, 2636 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3331 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 21:02:15,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3331 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-18 21:02:15,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2022-11-18 21:02:15,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1368. [2022-11-18 21:02:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 971 states have (on average 1.223480947476828) internal successors, (1188), 993 states have internal predecessors, (1188), 302 states have call successors, (302), 92 states have call predecessors, (302), 94 states have return successors, (329), 297 states have call predecessors, (329), 300 states have call successors, (329) [2022-11-18 21:02:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1819 transitions. [2022-11-18 21:02:15,584 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1819 transitions. Word has length 157 [2022-11-18 21:02:15,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:02:15,585 INFO L495 AbstractCegarLoop]: Abstraction has 1368 states and 1819 transitions. [2022-11-18 21:02:15,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-18 21:02:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1819 transitions. [2022-11-18 21:02:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-11-18 21:02:15,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:02:15,589 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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-18 21:02:15,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 21:02:15,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-18 21:02:15,799 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:02:15,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:02:15,800 INFO L85 PathProgramCache]: Analyzing trace with hash -635858733, now seen corresponding path program 1 times [2022-11-18 21:02:15,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:02:15,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418915061] [2022-11-18 21:02:15,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:02:15,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:02:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:17,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:02:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:17,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 21:02:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:17,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 21:02:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:17,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 21:02:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:17,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 21:02:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:17,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 21:02:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:17,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:02:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:17,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:02:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:17,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:17,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:17,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:02:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:17,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:17,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:17,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 21:02:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:17,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:17,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:17,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 21:02:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:17,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:17,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:17,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-18 21:02:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:17,645 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-18 21:02:17,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:02:17,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418915061] [2022-11-18 21:02:17,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418915061] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:02:17,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315256293] [2022-11-18 21:02:17,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:02:17,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:02:17,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:02:17,648 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:02:17,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 21:02:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:18,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 1935 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-18 21:02:18,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:02:18,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 21:02:18,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 21:02:18,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 21:02:18,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 21:02:19,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 21:02:19,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 21:02:19,144 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-18 21:02:19,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:02:19,515 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-18 21:02:19,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315256293] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:02:19,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:02:19,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 17 [2022-11-18 21:02:19,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132396842] [2022-11-18 21:02:19,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:02:19,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 21:02:19,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:02:19,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 21:02:19,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-11-18 21:02:19,524 INFO L87 Difference]: Start difference. First operand 1368 states and 1819 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 12 states have internal predecessors, (109), 6 states have call successors, (29), 6 states have call predecessors, (29), 5 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) [2022-11-18 21:02:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:02:27,657 INFO L93 Difference]: Finished difference Result 2442 states and 3268 transitions. [2022-11-18 21:02:27,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 21:02:27,658 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 12 states have internal predecessors, (109), 6 states have call successors, (29), 6 states have call predecessors, (29), 5 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) Word has length 158 [2022-11-18 21:02:27,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:02:27,668 INFO L225 Difference]: With dead ends: 2442 [2022-11-18 21:02:27,668 INFO L226 Difference]: Without dead ends: 1370 [2022-11-18 21:02:27,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 344 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2022-11-18 21:02:27,673 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 188 mSDsluCounter, 4142 mSDsCounter, 0 mSdLazyCounter, 2969 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 4653 SdHoareTripleChecker+Invalid, 3876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 790 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-11-18 21:02:27,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 4653 Invalid, 3876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2969 Invalid, 0 Unknown, 790 Unchecked, 7.9s Time] [2022-11-18 21:02:27,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2022-11-18 21:02:27,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2022-11-18 21:02:27,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 971 states have (on average 1.223480947476828) internal successors, (1188), 993 states have internal predecessors, (1188), 302 states have call successors, (302), 92 states have call predecessors, (302), 94 states have return successors, (328), 297 states have call predecessors, (328), 300 states have call successors, (328) [2022-11-18 21:02:27,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1818 transitions. [2022-11-18 21:02:27,776 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1818 transitions. Word has length 158 [2022-11-18 21:02:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:02:27,777 INFO L495 AbstractCegarLoop]: Abstraction has 1368 states and 1818 transitions. [2022-11-18 21:02:27,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 12 states have internal predecessors, (109), 6 states have call successors, (29), 6 states have call predecessors, (29), 5 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) [2022-11-18 21:02:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1818 transitions. [2022-11-18 21:02:27,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-11-18 21:02:27,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:02:27,781 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:02:27,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 21:02:27,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-18 21:02:27,992 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:02:27,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:02:27,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1143023629, now seen corresponding path program 2 times [2022-11-18 21:02:27,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:02:27,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316552326] [2022-11-18 21:02:27,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:02:27,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:02:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:29,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:02:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:29,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 21:02:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:29,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 21:02:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:29,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 21:02:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:29,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 21:02:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:29,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 21:02:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:29,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:02:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:29,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:02:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:29,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:29,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:29,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:02:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:29,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:29,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:29,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 21:02:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:29,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:29,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:29,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 21:02:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:29,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:29,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:29,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-18 21:02:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-18 21:02:29,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:02:29,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316552326] [2022-11-18 21:02:29,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316552326] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:02:29,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60878617] [2022-11-18 21:02:29,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 21:02:29,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:02:29,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:02:29,472 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:02:29,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 21:02:30,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 21:02:30,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 21:02:30,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 1943 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-18 21:02:30,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:02:30,852 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-11-18 21:02:30,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:02:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-11-18 21:02:31,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60878617] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:02:31,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:02:31,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 11] total 20 [2022-11-18 21:02:31,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986592624] [2022-11-18 21:02:31,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:02:31,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 21:02:31,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:02:31,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 21:02:31,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2022-11-18 21:02:31,591 INFO L87 Difference]: Start difference. First operand 1368 states and 1818 transitions. Second operand has 20 states, 20 states have (on average 8.6) internal successors, (172), 18 states have internal predecessors, (172), 13 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (42), 11 states have call predecessors, (42), 12 states have call successors, (42) [2022-11-18 21:02:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:02:40,542 INFO L93 Difference]: Finished difference Result 1796 states and 2349 transitions. [2022-11-18 21:02:40,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-18 21:02:40,543 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 8.6) internal successors, (172), 18 states have internal predecessors, (172), 13 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (42), 11 states have call predecessors, (42), 12 states have call successors, (42) Word has length 158 [2022-11-18 21:02:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:02:40,553 INFO L225 Difference]: With dead ends: 1796 [2022-11-18 21:02:40,554 INFO L226 Difference]: Without dead ends: 1782 [2022-11-18 21:02:40,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 347 SyntacticMatches, 8 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=283, Invalid=709, Unknown=0, NotChecked=0, Total=992 [2022-11-18 21:02:40,556 INFO L413 NwaCegarLoop]: 643 mSDtfsCounter, 6297 mSDsluCounter, 3215 mSDsCounter, 0 mSdLazyCounter, 4142 mSolverCounterSat, 3193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6522 SdHoareTripleChecker+Valid, 3858 SdHoareTripleChecker+Invalid, 7335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3193 IncrementalHoareTripleChecker+Valid, 4142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-11-18 21:02:40,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6522 Valid, 3858 Invalid, 7335 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3193 Valid, 4142 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2022-11-18 21:02:40,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2022-11-18 21:02:40,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1733. [2022-11-18 21:02:40,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1227 states have (on average 1.2208638956805216) internal successors, (1498), 1256 states have internal predecessors, (1498), 378 states have call successors, (378), 124 states have call predecessors, (378), 127 states have return successors, (411), 371 states have call predecessors, (411), 376 states have call successors, (411) [2022-11-18 21:02:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2287 transitions. [2022-11-18 21:02:40,691 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2287 transitions. Word has length 158 [2022-11-18 21:02:40,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:02:40,692 INFO L495 AbstractCegarLoop]: Abstraction has 1733 states and 2287 transitions. [2022-11-18 21:02:40,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 8.6) internal successors, (172), 18 states have internal predecessors, (172), 13 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (42), 11 states have call predecessors, (42), 12 states have call successors, (42) [2022-11-18 21:02:40,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2287 transitions. [2022-11-18 21:02:40,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-11-18 21:02:40,696 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:02:40,697 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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-18 21:02:40,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 21:02:40,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:02:40,907 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:02:40,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:02:40,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1453577679, now seen corresponding path program 1 times [2022-11-18 21:02:40,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:02:40,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714599498] [2022-11-18 21:02:40,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:02:40,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:02:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:02:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 21:02:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 21:02:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 21:02:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 21:02:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 21:02:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:02:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:02:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:02:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 21:02:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 21:02:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-18 21:02:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-18 21:02:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-11-18 21:02:41,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:02:41,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714599498] [2022-11-18 21:02:41,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714599498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:02:41,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:02:41,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 21:02:41,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907045608] [2022-11-18 21:02:41,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:02:41,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 21:02:41,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:02:41,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 21:02:41,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-18 21:02:41,637 INFO L87 Difference]: Start difference. First operand 1733 states and 2287 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-18 21:02:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:02:45,808 INFO L93 Difference]: Finished difference Result 3140 states and 4164 transitions. [2022-11-18 21:02:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 21:02:45,809 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 168 [2022-11-18 21:02:45,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:02:45,820 INFO L225 Difference]: With dead ends: 3140 [2022-11-18 21:02:45,820 INFO L226 Difference]: Without dead ends: 1733 [2022-11-18 21:02:45,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-11-18 21:02:45,826 INFO L413 NwaCegarLoop]: 507 mSDtfsCounter, 345 mSDsluCounter, 2629 mSDsCounter, 0 mSdLazyCounter, 1915 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 3136 SdHoareTripleChecker+Invalid, 2161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:02:45,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 3136 Invalid, 2161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1915 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-18 21:02:45,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2022-11-18 21:02:45,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1731. [2022-11-18 21:02:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1225 states have (on average 1.220408163265306) internal successors, (1495), 1255 states have internal predecessors, (1495), 378 states have call successors, (378), 124 states have call predecessors, (378), 127 states have return successors, (411), 370 states have call predecessors, (411), 376 states have call successors, (411) [2022-11-18 21:02:45,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2284 transitions. [2022-11-18 21:02:45,949 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2284 transitions. Word has length 168 [2022-11-18 21:02:45,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:02:45,950 INFO L495 AbstractCegarLoop]: Abstraction has 1731 states and 2284 transitions. [2022-11-18 21:02:45,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-18 21:02:45,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2284 transitions. [2022-11-18 21:02:45,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-11-18 21:02:45,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:02:45,955 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-11-18 21:02:45,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 21:02:45,955 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:02:45,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:02:45,956 INFO L85 PathProgramCache]: Analyzing trace with hash 496722576, now seen corresponding path program 2 times [2022-11-18 21:02:45,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:02:45,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684918672] [2022-11-18 21:02:45,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:02:45,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:02:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:02:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 21:02:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 21:02:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 21:02:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 21:02:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 21:02:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:02:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:02:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:02:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 21:02:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 21:02:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:02:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:02:46,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-18 21:02:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-18 21:02:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:02:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-11-18 21:02:46,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:02:46,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684918672] [2022-11-18 21:02:46,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684918672] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:02:46,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747992988] [2022-11-18 21:02:46,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 21:02:46,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:02:46,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:02:46,789 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:02:46,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 21:02:47,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 21:02:47,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 21:02:47,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 1975 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 21:02:47,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:02:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-11-18 21:02:48,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:02:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 2 proven. 53 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-18 21:02:48,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747992988] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:02:48,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:02:48,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 15] total 26 [2022-11-18 21:02:48,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359239579] [2022-11-18 21:02:48,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:02:48,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-18 21:02:48,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:02:48,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-18 21:02:48,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2022-11-18 21:02:48,956 INFO L87 Difference]: Start difference. First operand 1731 states and 2284 transitions. Second operand has 26 states, 25 states have (on average 7.72) internal successors, (193), 22 states have internal predecessors, (193), 13 states have call successors, (49), 13 states have call predecessors, (49), 11 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) [2022-11-18 21:03:05,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:03:05,559 INFO L93 Difference]: Finished difference Result 3288 states and 4334 transitions. [2022-11-18 21:03:05,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-18 21:03:05,560 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 7.72) internal successors, (193), 22 states have internal predecessors, (193), 13 states have call successors, (49), 13 states have call predecessors, (49), 11 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) Word has length 168 [2022-11-18 21:03:05,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:03:05,577 INFO L225 Difference]: With dead ends: 3288 [2022-11-18 21:03:05,578 INFO L226 Difference]: Without dead ends: 3180 [2022-11-18 21:03:05,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 359 SyntacticMatches, 8 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=888, Invalid=3018, Unknown=0, NotChecked=0, Total=3906 [2022-11-18 21:03:05,582 INFO L413 NwaCegarLoop]: 644 mSDtfsCounter, 5946 mSDsluCounter, 4884 mSDsCounter, 0 mSdLazyCounter, 8299 mSolverCounterSat, 3471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6215 SdHoareTripleChecker+Valid, 5528 SdHoareTripleChecker+Invalid, 11770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3471 IncrementalHoareTripleChecker+Valid, 8299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2022-11-18 21:03:05,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6215 Valid, 5528 Invalid, 11770 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3471 Valid, 8299 Invalid, 0 Unknown, 0 Unchecked, 15.4s Time] [2022-11-18 21:03:05,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2022-11-18 21:03:05,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 3112. [2022-11-18 21:03:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3112 states, 2199 states have (on average 1.2223738062755798) internal successors, (2688), 2255 states have internal predecessors, (2688), 687 states have call successors, (687), 217 states have call predecessors, (687), 225 states have return successors, (755), 673 states have call predecessors, (755), 685 states have call successors, (755) [2022-11-18 21:03:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 4130 transitions. [2022-11-18 21:03:05,890 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 4130 transitions. Word has length 168 [2022-11-18 21:03:05,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:03:05,896 INFO L495 AbstractCegarLoop]: Abstraction has 3112 states and 4130 transitions. [2022-11-18 21:03:05,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 7.72) internal successors, (193), 22 states have internal predecessors, (193), 13 states have call successors, (49), 13 states have call predecessors, (49), 11 states have return successors, (46), 10 states have call predecessors, (46), 11 states have call successors, (46) [2022-11-18 21:03:05,897 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 4130 transitions. [2022-11-18 21:03:05,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-18 21:03:05,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:03:05,901 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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-18 21:03:05,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 21:03:06,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-18 21:03:06,111 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:03:06,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:03:06,112 INFO L85 PathProgramCache]: Analyzing trace with hash -645774525, now seen corresponding path program 1 times [2022-11-18 21:03:06,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:03:06,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35959361] [2022-11-18 21:03:06,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:03:06,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:03:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:03:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 21:03:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 21:03:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 21:03:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 21:03:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 21:03:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:03:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:03:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:03:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 21:03:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 21:03:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-18 21:03:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-18 21:03:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-11-18 21:03:07,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:03:07,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35959361] [2022-11-18 21:03:07,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35959361] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:03:07,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606208793] [2022-11-18 21:03:07,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:03:07,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:03:07,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:03:07,511 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:03:07,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 21:03:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:08,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 1972 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-18 21:03:08,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:03:08,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 21:03:08,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 21:03:08,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 21:03:08,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 21:03:09,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2022-11-18 21:03:09,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 21:03:09,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2022-11-18 21:03:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 55 proven. 8 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-11-18 21:03:09,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:03:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-11-18 21:03:09,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606208793] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:03:09,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:03:09,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 8] total 17 [2022-11-18 21:03:09,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311954889] [2022-11-18 21:03:09,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:03:09,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 21:03:09,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:03:09,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 21:03:09,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-11-18 21:03:09,620 INFO L87 Difference]: Start difference. First operand 3112 states and 4130 transitions. Second operand has 17 states, 16 states have (on average 7.6875) internal successors, (123), 11 states have internal predecessors, (123), 7 states have call successors, (32), 8 states have call predecessors, (32), 5 states have return successors, (23), 7 states have call predecessors, (23), 6 states have call successors, (23) [2022-11-18 21:03:14,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:03:14,086 INFO L93 Difference]: Finished difference Result 4952 states and 6543 transitions. [2022-11-18 21:03:14,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 21:03:14,087 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 7.6875) internal successors, (123), 11 states have internal predecessors, (123), 7 states have call successors, (32), 8 states have call predecessors, (32), 5 states have return successors, (23), 7 states have call predecessors, (23), 6 states have call successors, (23) Word has length 169 [2022-11-18 21:03:14,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:03:14,097 INFO L225 Difference]: With dead ends: 4952 [2022-11-18 21:03:14,098 INFO L226 Difference]: Without dead ends: 2107 [2022-11-18 21:03:14,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 367 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-11-18 21:03:14,107 INFO L413 NwaCegarLoop]: 508 mSDtfsCounter, 348 mSDsluCounter, 3383 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 3891 SdHoareTripleChecker+Invalid, 2892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 383 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-18 21:03:14,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 3891 Invalid, 2892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 2261 Invalid, 0 Unknown, 383 Unchecked, 4.2s Time] [2022-11-18 21:03:14,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2022-11-18 21:03:14,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 2096. [2022-11-18 21:03:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2096 states, 1482 states have (on average 1.2179487179487178) internal successors, (1805), 1519 states have internal predecessors, (1805), 452 states have call successors, (452), 156 states have call predecessors, (452), 161 states have return successors, (488), 443 states have call predecessors, (488), 450 states have call successors, (488) [2022-11-18 21:03:14,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 2745 transitions. [2022-11-18 21:03:14,238 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 2745 transitions. Word has length 169 [2022-11-18 21:03:14,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:03:14,239 INFO L495 AbstractCegarLoop]: Abstraction has 2096 states and 2745 transitions. [2022-11-18 21:03:14,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 7.6875) internal successors, (123), 11 states have internal predecessors, (123), 7 states have call successors, (32), 8 states have call predecessors, (32), 5 states have return successors, (23), 7 states have call predecessors, (23), 6 states have call successors, (23) [2022-11-18 21:03:14,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 2745 transitions. [2022-11-18 21:03:14,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-11-18 21:03:14,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:03:14,243 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:03:14,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 21:03:14,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:03:14,458 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:03:14,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:03:14,458 INFO L85 PathProgramCache]: Analyzing trace with hash -761850914, now seen corresponding path program 1 times [2022-11-18 21:03:14,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:03:14,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393216304] [2022-11-18 21:03:14,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:03:14,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:03:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:14,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:03:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:14,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 21:03:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:14,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 21:03:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:14,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 21:03:14,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:14,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 21:03:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:14,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 21:03:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:15,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:03:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:15,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:03:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:15,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:15,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:15,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:03:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:15,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:15,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:15,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 21:03:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:15,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:15,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:15,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 21:03:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:15,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:15,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:15,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-18 21:03:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:15,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-11-18 21:03:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:15,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-11-18 21:03:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-11-18 21:03:15,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:03:15,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393216304] [2022-11-18 21:03:15,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393216304] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:03:15,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331605966] [2022-11-18 21:03:15,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:03:15,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:03:15,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:03:15,182 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:03:15,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 21:03:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:15,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 2004 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 21:03:15,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:03:16,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-18 21:03:16,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-18 21:03:16,254 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-11-18 21:03:16,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:03:16,439 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-11-18 21:03:16,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331605966] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 21:03:16,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-18 21:03:16,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2022-11-18 21:03:16,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926239350] [2022-11-18 21:03:16,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:03:16,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:03:16,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:03:16,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:03:16,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-18 21:03:16,442 INFO L87 Difference]: Start difference. First operand 2096 states and 2745 transitions. Second operand has 7 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 4 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 21:03:17,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:03:17,503 INFO L93 Difference]: Finished difference Result 2162 states and 2804 transitions. [2022-11-18 21:03:17,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 21:03:17,504 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 4 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 179 [2022-11-18 21:03:17,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:03:17,513 INFO L225 Difference]: With dead ends: 2162 [2022-11-18 21:03:17,513 INFO L226 Difference]: Without dead ends: 2067 [2022-11-18 21:03:17,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 392 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-11-18 21:03:17,515 INFO L413 NwaCegarLoop]: 685 mSDtfsCounter, 8 mSDsluCounter, 2594 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3279 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:03:17,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3279 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-18 21:03:17,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2022-11-18 21:03:17,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 2067. [2022-11-18 21:03:17,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2067 states, 1467 states have (on average 1.2194955691888207) internal successors, (1789), 1504 states have internal predecessors, (1789), 438 states have call successors, (438), 156 states have call predecessors, (438), 161 states have return successors, (464), 429 states have call predecessors, (464), 436 states have call successors, (464) [2022-11-18 21:03:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 2691 transitions. [2022-11-18 21:03:17,635 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 2691 transitions. Word has length 179 [2022-11-18 21:03:17,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:03:17,636 INFO L495 AbstractCegarLoop]: Abstraction has 2067 states and 2691 transitions. [2022-11-18 21:03:17,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 4 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-18 21:03:17,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 2691 transitions. [2022-11-18 21:03:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-11-18 21:03:17,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:03:17,642 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:03:17,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 21:03:17,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-18 21:03:17,851 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:03:17,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:03:17,851 INFO L85 PathProgramCache]: Analyzing trace with hash 16369044, now seen corresponding path program 1 times [2022-11-18 21:03:17,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:03:17,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291646553] [2022-11-18 21:03:17,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:03:17,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:03:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:18,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:03:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:18,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 21:03:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:18,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 21:03:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:18,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 21:03:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:18,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 21:03:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:18,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 21:03:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:18,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:03:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:18,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:03:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:03:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 21:03:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 21:03:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-18 21:03:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-18 21:03:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-18 21:03:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-18 21:03:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-18 21:03:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-18 21:03:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-18 21:03:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-11-18 21:03:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-18 21:03:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-18 21:03:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-18 21:03:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-11-18 21:03:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2022-11-18 21:03:19,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:03:19,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291646553] [2022-11-18 21:03:19,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291646553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:03:19,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:03:19,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 21:03:19,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516726011] [2022-11-18 21:03:19,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:03:19,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 21:03:19,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:03:19,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 21:03:19,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-18 21:03:19,327 INFO L87 Difference]: Start difference. First operand 2067 states and 2691 transitions. Second operand has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 5 states have internal predecessors, (119), 3 states have call successors, (27), 5 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-11-18 21:03:23,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:03:23,780 INFO L93 Difference]: Finished difference Result 3853 states and 5056 transitions. [2022-11-18 21:03:23,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 21:03:23,780 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 5 states have internal predecessors, (119), 3 states have call successors, (27), 5 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 254 [2022-11-18 21:03:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:03:23,790 INFO L225 Difference]: With dead ends: 3853 [2022-11-18 21:03:23,791 INFO L226 Difference]: Without dead ends: 2100 [2022-11-18 21:03:23,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-11-18 21:03:23,796 INFO L413 NwaCegarLoop]: 475 mSDtfsCounter, 303 mSDsluCounter, 2170 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 2253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-18 21:03:23,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 2645 Invalid, 2253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 2011 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-18 21:03:23,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2022-11-18 21:03:23,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2060. [2022-11-18 21:03:23,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2060 states, 1462 states have (on average 1.2202462380300958) internal successors, (1784), 1499 states have internal predecessors, (1784), 438 states have call successors, (438), 156 states have call predecessors, (438), 159 states have return successors, (461), 427 states have call predecessors, (461), 436 states have call successors, (461) [2022-11-18 21:03:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 2683 transitions. [2022-11-18 21:03:23,924 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 2683 transitions. Word has length 254 [2022-11-18 21:03:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:03:23,924 INFO L495 AbstractCegarLoop]: Abstraction has 2060 states and 2683 transitions. [2022-11-18 21:03:23,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.222222222222221) internal successors, (119), 5 states have internal predecessors, (119), 3 states have call successors, (27), 5 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-11-18 21:03:23,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 2683 transitions. [2022-11-18 21:03:23,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-11-18 21:03:23,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:03:23,928 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:03:23,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 21:03:23,928 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:03:23,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:03:23,929 INFO L85 PathProgramCache]: Analyzing trace with hash 664622260, now seen corresponding path program 1 times [2022-11-18 21:03:23,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:03:23,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231653355] [2022-11-18 21:03:23,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:03:23,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:03:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:03:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 21:03:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 21:03:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 21:03:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 21:03:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 21:03:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:03:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:03:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:03:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 21:03:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 21:03:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-18 21:03:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-18 21:03:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-18 21:03:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-18 21:03:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-18 21:03:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-18 21:03:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-18 21:03:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-11-18 21:03:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-18 21:03:24,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-18 21:03:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-18 21:03:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-11-18 21:03:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2022-11-18 21:03:24,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:03:24,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231653355] [2022-11-18 21:03:24,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231653355] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:03:24,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:03:24,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:03:24,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242720473] [2022-11-18 21:03:24,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:03:24,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:03:24,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:03:24,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:03:24,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:03:24,538 INFO L87 Difference]: Start difference. First operand 2060 states and 2683 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 4 states have internal predecessors, (116), 4 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-18 21:03:27,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:03:27,612 INFO L93 Difference]: Finished difference Result 2120 states and 2782 transitions. [2022-11-18 21:03:27,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 21:03:27,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 4 states have internal predecessors, (116), 4 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) Word has length 254 [2022-11-18 21:03:27,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:03:27,622 INFO L225 Difference]: With dead ends: 2120 [2022-11-18 21:03:27,622 INFO L226 Difference]: Without dead ends: 2110 [2022-11-18 21:03:27,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-11-18 21:03:27,624 INFO L413 NwaCegarLoop]: 651 mSDtfsCounter, 1003 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-18 21:03:27,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 2184 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-18 21:03:27,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2022-11-18 21:03:27,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 2060. [2022-11-18 21:03:27,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2060 states, 1462 states have (on average 1.219562243502052) internal successors, (1783), 1499 states have internal predecessors, (1783), 438 states have call successors, (438), 156 states have call predecessors, (438), 159 states have return successors, (461), 427 states have call predecessors, (461), 436 states have call successors, (461) [2022-11-18 21:03:27,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 2682 transitions. [2022-11-18 21:03:27,767 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 2682 transitions. Word has length 254 [2022-11-18 21:03:27,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:03:27,767 INFO L495 AbstractCegarLoop]: Abstraction has 2060 states and 2682 transitions. [2022-11-18 21:03:27,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 4 states have internal predecessors, (116), 4 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-18 21:03:27,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 2682 transitions. [2022-11-18 21:03:27,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-11-18 21:03:27,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:03:27,771 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:03:27,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 21:03:27,771 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:03:27,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:03:27,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1704405801, now seen corresponding path program 1 times [2022-11-18 21:03:27,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:03:27,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523438986] [2022-11-18 21:03:27,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:03:27,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:03:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:03:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 21:03:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 21:03:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 21:03:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 21:03:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 21:03:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:03:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:03:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:03:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 21:03:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 21:03:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-18 21:03:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-18 21:03:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-18 21:03:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-18 21:03:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-18 21:03:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-18 21:03:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-18 21:03:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-11-18 21:03:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-18 21:03:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-18 21:03:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-18 21:03:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-11-18 21:03:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:28,439 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2022-11-18 21:03:28,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:03:28,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523438986] [2022-11-18 21:03:28,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523438986] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:03:28,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788975230] [2022-11-18 21:03:28,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:03:28,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:03:28,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:03:28,441 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:03:28,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 21:03:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:29,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 3068 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 21:03:29,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:03:29,633 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2022-11-18 21:03:29,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:03:29,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788975230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:03:29,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 21:03:29,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2022-11-18 21:03:29,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875002974] [2022-11-18 21:03:29,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:03:29,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:03:29,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:03:29,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:03:29,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 21:03:29,636 INFO L87 Difference]: Start difference. First operand 2060 states and 2682 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-11-18 21:03:29,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:03:29,966 INFO L93 Difference]: Finished difference Result 3798 states and 4957 transitions. [2022-11-18 21:03:29,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 21:03:29,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 259 [2022-11-18 21:03:29,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:03:29,975 INFO L225 Difference]: With dead ends: 3798 [2022-11-18 21:03:29,975 INFO L226 Difference]: Without dead ends: 2064 [2022-11-18 21:03:29,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 21:03:29,980 INFO L413 NwaCegarLoop]: 895 mSDtfsCounter, 357 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 21:03:29,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1842 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 21:03:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2022-11-18 21:03:30,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 2060. [2022-11-18 21:03:30,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2060 states, 1462 states have (on average 1.2181942544459645) internal successors, (1781), 1499 states have internal predecessors, (1781), 438 states have call successors, (438), 156 states have call predecessors, (438), 159 states have return successors, (461), 427 states have call predecessors, (461), 436 states have call successors, (461) [2022-11-18 21:03:30,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 2680 transitions. [2022-11-18 21:03:30,124 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 2680 transitions. Word has length 259 [2022-11-18 21:03:30,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:03:30,125 INFO L495 AbstractCegarLoop]: Abstraction has 2060 states and 2680 transitions. [2022-11-18 21:03:30,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-11-18 21:03:30,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 2680 transitions. [2022-11-18 21:03:30,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-11-18 21:03:30,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:03:30,129 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:03:30,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 21:03:30,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:03:30,340 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:03:30,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:03:30,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1922177855, now seen corresponding path program 1 times [2022-11-18 21:03:30,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:03:30,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196626699] [2022-11-18 21:03:30,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:03:30,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:03:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:30,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:03:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:30,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 21:03:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:30,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 21:03:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:30,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 21:03:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:30,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 21:03:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:30,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 21:03:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:30,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:03:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:30,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:03:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:30,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:30,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:30,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:03:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:30,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:30,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:30,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 21:03:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:30,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:30,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:30,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 21:03:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:30,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:30,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:30,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-18 21:03:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:30,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-18 21:03:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:31,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-18 21:03:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:31,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-18 21:03:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:31,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-18 21:03:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:31,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-18 21:03:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:31,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-18 21:03:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:31,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:31,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-11-18 21:03:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:31,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:31,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-18 21:03:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:31,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:31,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-18 21:03:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:31,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-18 21:03:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:31,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-11-18 21:03:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:31,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-11-18 21:03:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:31,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-11-18 21:03:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:31,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2022-11-18 21:03:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2022-11-18 21:03:31,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:03:31,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196626699] [2022-11-18 21:03:31,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196626699] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:03:31,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769622284] [2022-11-18 21:03:31,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:03:31,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:03:31,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:03:31,241 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:03:31,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 21:03:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:32,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 3165 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 21:03:32,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:03:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2022-11-18 21:03:32,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:03:32,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769622284] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:03:32,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 21:03:32,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-11-18 21:03:32,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870751263] [2022-11-18 21:03:32,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:03:32,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:03:32,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:03:32,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:03:32,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-18 21:03:32,641 INFO L87 Difference]: Start difference. First operand 2060 states and 2680 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-18 21:03:32,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:03:32,909 INFO L93 Difference]: Finished difference Result 3802 states and 4975 transitions. [2022-11-18 21:03:32,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 21:03:32,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 279 [2022-11-18 21:03:32,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:03:32,923 INFO L225 Difference]: With dead ends: 3802 [2022-11-18 21:03:32,923 INFO L226 Difference]: Without dead ends: 2068 [2022-11-18 21:03:32,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-18 21:03:32,929 INFO L413 NwaCegarLoop]: 655 mSDtfsCounter, 29 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:03:32,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1906 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:03:32,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2022-11-18 21:03:33,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2068. [2022-11-18 21:03:33,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2068 states, 1469 states have (on average 1.2178352620830497) internal successors, (1789), 1506 states have internal predecessors, (1789), 438 states have call successors, (438), 157 states have call predecessors, (438), 160 states have return successors, (461), 427 states have call predecessors, (461), 436 states have call successors, (461) [2022-11-18 21:03:33,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 2688 transitions. [2022-11-18 21:03:33,102 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 2688 transitions. Word has length 279 [2022-11-18 21:03:33,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:03:33,103 INFO L495 AbstractCegarLoop]: Abstraction has 2068 states and 2688 transitions. [2022-11-18 21:03:33,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-18 21:03:33,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2688 transitions. [2022-11-18 21:03:33,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-11-18 21:03:33,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:03:33,107 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:03:33,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-18 21:03:33,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:03:33,321 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:03:33,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:03:33,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1296304718, now seen corresponding path program 1 times [2022-11-18 21:03:33,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:03:33,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479785055] [2022-11-18 21:03:33,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:03:33,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:03:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:44,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:03:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:44,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 21:03:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:44,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 21:03:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:44,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 21:03:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:44,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 21:03:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:44,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 21:03:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:44,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:03:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:44,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:03:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:44,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:45,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:45,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:03:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:45,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:45,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:45,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 21:03:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:45,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:45,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:46,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 21:03:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:46,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:46,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:03:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:46,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-18 21:03:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:46,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-18 21:03:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:46,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-18 21:03:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:46,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-18 21:03:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:46,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-18 21:03:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:46,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-18 21:03:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:46,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-18 21:03:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:47,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:47,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-11-18 21:03:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:48,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:48,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-18 21:03:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:48,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:03:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:48,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-18 21:03:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:48,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-18 21:03:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:48,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-11-18 21:03:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:48,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-11-18 21:03:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:48,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-11-18 21:03:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:48,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2022-11-18 21:03:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 41 proven. 66 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-11-18 21:03:48,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:03:48,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479785055] [2022-11-18 21:03:48,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479785055] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:03:48,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546736857] [2022-11-18 21:03:48,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:03:48,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:03:48,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:03:48,720 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:03:48,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-18 21:03:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:03:49,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 3163 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-18 21:03:49,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:03:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 72 proven. 6 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-11-18 21:03:51,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:03:53,977 INFO L321 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2022-11-18 21:03:53,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 36 [2022-11-18 21:03:54,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 74 [2022-11-18 21:03:54,233 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-18 21:03:54,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 11 [2022-11-18 21:03:54,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 21:03:54,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-18 21:03:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 23 proven. 30 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-11-18 21:03:54,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546736857] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:03:54,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:03:54,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 17, 15] total 81 [2022-11-18 21:03:54,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479350760] [2022-11-18 21:03:54,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:03:54,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-18 21:03:54,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:03:54,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-18 21:03:54,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=6216, Unknown=0, NotChecked=0, Total=6480 [2022-11-18 21:03:54,363 INFO L87 Difference]: Start difference. First operand 2068 states and 2688 transitions. Second operand has 81 states, 71 states have (on average 3.859154929577465) internal successors, (274), 59 states have internal predecessors, (274), 22 states have call successors, (63), 6 states have call predecessors, (63), 24 states have return successors, (69), 27 states have call predecessors, (69), 22 states have call successors, (69) [2022-11-18 21:05:04,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:05:04,103 INFO L93 Difference]: Finished difference Result 4979 states and 6819 transitions. [2022-11-18 21:05:04,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-11-18 21:05:04,104 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 71 states have (on average 3.859154929577465) internal successors, (274), 59 states have internal predecessors, (274), 22 states have call successors, (63), 6 states have call predecessors, (63), 24 states have return successors, (69), 27 states have call predecessors, (69), 22 states have call successors, (69) Word has length 279 [2022-11-18 21:05:04,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:05:04,119 INFO L225 Difference]: With dead ends: 4979 [2022-11-18 21:05:04,120 INFO L226 Difference]: Without dead ends: 3237 [2022-11-18 21:05:04,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 760 GetRequests, 619 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4409 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=1224, Invalid=18798, Unknown=0, NotChecked=0, Total=20022 [2022-11-18 21:05:04,132 INFO L413 NwaCegarLoop]: 667 mSDtfsCounter, 1815 mSDsluCounter, 22913 mSDsCounter, 0 mSdLazyCounter, 30745 mSolverCounterSat, 1218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 23580 SdHoareTripleChecker+Invalid, 35088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 1218 IncrementalHoareTripleChecker+Valid, 30745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3125 IncrementalHoareTripleChecker+Unchecked, 62.3s IncrementalHoareTripleChecker+Time [2022-11-18 21:05:04,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 23580 Invalid, 35088 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [1218 Valid, 30745 Invalid, 0 Unknown, 3125 Unchecked, 62.3s Time] [2022-11-18 21:05:04,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3237 states. [2022-11-18 21:05:04,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3237 to 2178. [2022-11-18 21:05:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2178 states, 1549 states have (on average 1.2149774047772757) internal successors, (1882), 1587 states have internal predecessors, (1882), 462 states have call successors, (462), 162 states have call predecessors, (462), 166 states have return successors, (524), 451 states have call predecessors, (524), 460 states have call successors, (524) [2022-11-18 21:05:04,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 2868 transitions. [2022-11-18 21:05:04,352 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 2868 transitions. Word has length 279 [2022-11-18 21:05:04,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:05:04,353 INFO L495 AbstractCegarLoop]: Abstraction has 2178 states and 2868 transitions. [2022-11-18 21:05:04,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 71 states have (on average 3.859154929577465) internal successors, (274), 59 states have internal predecessors, (274), 22 states have call successors, (63), 6 states have call predecessors, (63), 24 states have return successors, (69), 27 states have call predecessors, (69), 22 states have call successors, (69) [2022-11-18 21:05:04,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 2868 transitions. [2022-11-18 21:05:04,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2022-11-18 21:05:04,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:05:04,359 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:05:04,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-18 21:05:04,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:05:04,573 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:05:04,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:05:04,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2001105311, now seen corresponding path program 1 times [2022-11-18 21:05:04,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:05:04,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067469558] [2022-11-18 21:05:04,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:05:04,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:05:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:20,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:05:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:20,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 21:05:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:21,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 21:05:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:21,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 21:05:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:21,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 21:05:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:21,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 21:05:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:21,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:05:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:21,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:05:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:21,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:05:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:21,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:05:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:21,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:05:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:21,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:05:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:21,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:05:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:22,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 21:05:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:22,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:05:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:22,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:05:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:22,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 21:05:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:23,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:05:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:23,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:05:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:23,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-18 21:05:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:23,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-18 21:05:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:23,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-18 21:05:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:23,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-18 21:05:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:23,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-18 21:05:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:23,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-18 21:05:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:23,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-18 21:05:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:23,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:05:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:23,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-18 21:05:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:24,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:05:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:25,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-18 21:05:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:25,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:05:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:26,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-11-18 21:05:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:26,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-18 21:05:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:26,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-11-18 21:05:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:26,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-11-18 21:05:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:26,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-11-18 21:05:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:26,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-11-18 21:05:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:26,164 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 48 proven. 61 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-11-18 21:05:26,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:05:26,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067469558] [2022-11-18 21:05:26,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067469558] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:05:26,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831354874] [2022-11-18 21:05:26,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:05:26,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:05:26,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:05:26,168 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:05:26,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-18 21:05:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:05:27,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 3164 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-18 21:05:27,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:05:51,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2022-11-18 21:05:51,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 55 [2022-11-18 21:05:51,676 INFO L321 Elim1Store]: treesize reduction 106, result has 36.9 percent of original size [2022-11-18 21:05:51,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 88 [2022-11-18 21:05:54,931 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 64 proven. 14 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-11-18 21:05:54,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:05:56,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 111 [2022-11-18 21:05:56,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 69 [2022-11-18 21:05:56,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 31 [2022-11-18 21:05:57,423 INFO L321 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2022-11-18 21:05:57,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 50 [2022-11-18 21:05:58,322 INFO L321 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2022-11-18 21:05:58,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 327 treesize of output 1 [2022-11-18 21:05:58,345 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-18 21:05:58,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 57 [2022-11-18 21:05:58,362 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-18 21:05:58,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 26 [2022-11-18 21:05:58,508 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-11-18 21:05:58,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831354874] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:05:58,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:05:58,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 21, 16] total 88 [2022-11-18 21:05:58,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991578519] [2022-11-18 21:05:58,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:05:58,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-11-18 21:05:58,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:05:58,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-11-18 21:05:58,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=7330, Unknown=11, NotChecked=0, Total=7656 [2022-11-18 21:05:58,514 INFO L87 Difference]: Start difference. First operand 2178 states and 2868 transitions. Second operand has 88 states, 75 states have (on average 3.7733333333333334) internal successors, (283), 64 states have internal predecessors, (283), 25 states have call successors, (65), 7 states have call predecessors, (65), 25 states have return successors, (71), 29 states have call predecessors, (71), 25 states have call successors, (71) [2022-11-18 21:07:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:07:11,048 INFO L93 Difference]: Finished difference Result 4290 states and 5779 transitions. [2022-11-18 21:07:11,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-11-18 21:07:11,049 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 75 states have (on average 3.7733333333333334) internal successors, (283), 64 states have internal predecessors, (283), 25 states have call successors, (65), 7 states have call predecessors, (65), 25 states have return successors, (71), 29 states have call predecessors, (71), 25 states have call successors, (71) Word has length 280 [2022-11-18 21:07:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:07:11,060 INFO L225 Difference]: With dead ends: 4290 [2022-11-18 21:07:11,060 INFO L226 Difference]: Without dead ends: 2432 [2022-11-18 21:07:11,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 622 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5374 ImplicationChecksByTransitivity, 57.4s TimeCoverageRelationStatistics Valid=1404, Invalid=22437, Unknown=29, NotChecked=0, Total=23870 [2022-11-18 21:07:11,071 INFO L413 NwaCegarLoop]: 647 mSDtfsCounter, 1798 mSDsluCounter, 20425 mSDsCounter, 0 mSdLazyCounter, 21560 mSolverCounterSat, 1352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1867 SdHoareTripleChecker+Valid, 21072 SdHoareTripleChecker+Invalid, 25654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1352 IncrementalHoareTripleChecker+Valid, 21560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2742 IncrementalHoareTripleChecker+Unchecked, 46.7s IncrementalHoareTripleChecker+Time [2022-11-18 21:07:11,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1867 Valid, 21072 Invalid, 25654 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1352 Valid, 21560 Invalid, 0 Unknown, 2742 Unchecked, 46.7s Time] [2022-11-18 21:07:11,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2022-11-18 21:07:11,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 2293. [2022-11-18 21:07:11,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2293 states, 1630 states have (on average 1.2116564417177915) internal successors, (1975), 1672 states have internal predecessors, (1975), 487 states have call successors, (487), 167 states have call predecessors, (487), 175 states have return successors, (632), 476 states have call predecessors, (632), 485 states have call successors, (632) [2022-11-18 21:07:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 3094 transitions. [2022-11-18 21:07:11,267 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 3094 transitions. Word has length 280 [2022-11-18 21:07:11,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:07:11,268 INFO L495 AbstractCegarLoop]: Abstraction has 2293 states and 3094 transitions. [2022-11-18 21:07:11,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 75 states have (on average 3.7733333333333334) internal successors, (283), 64 states have internal predecessors, (283), 25 states have call successors, (65), 7 states have call predecessors, (65), 25 states have return successors, (71), 29 states have call predecessors, (71), 25 states have call successors, (71) [2022-11-18 21:07:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 3094 transitions. [2022-11-18 21:07:11,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2022-11-18 21:07:11,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:07:11,274 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:07:11,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-18 21:07:11,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:07:11,487 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:07:11,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:11,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1321440547, now seen corresponding path program 1 times [2022-11-18 21:07:11,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:11,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257129353] [2022-11-18 21:07:11,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:11,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:26,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-18 21:07:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:26,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-18 21:07:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:26,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-18 21:07:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:26,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-18 21:07:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:26,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-18 21:07:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:26,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-18 21:07:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:26,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-18 21:07:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:26,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-18 21:07:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:27,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:07:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:27,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:07:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:27,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-18 21:07:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:27,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:07:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:27,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:07:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:27,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-18 21:07:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:27,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:07:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:27,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:07:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:27,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-18 21:07:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:27,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:07:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:28,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-18 21:07:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:28,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-18 21:07:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:28,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-18 21:07:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:28,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-11-18 21:07:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:28,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-18 21:07:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:28,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-11-18 21:07:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:28,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-11-18 21:07:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:28,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-18 21:07:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:29,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:07:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:29,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-11-18 21:07:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:29,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:07:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:29,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-18 21:07:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:30,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 21:07:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:30,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-11-18 21:07:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:30,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-18 21:07:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:30,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-11-18 21:07:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:30,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-11-18 21:07:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:30,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-11-18 21:07:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:30,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-11-18 21:07:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:30,704 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-11-18 21:07:30,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:30,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257129353] [2022-11-18 21:07:30,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257129353] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 21:07:30,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075103052] [2022-11-18 21:07:30,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:30,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 21:07:30,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:07:30,707 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 21:07:30,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-18 21:07:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:32,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 3164 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-18 21:07:32,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:07:45,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2022-11-18 21:07:45,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2022-11-18 21:07:45,664 INFO L321 Elim1Store]: treesize reduction 106, result has 36.9 percent of original size [2022-11-18 21:07:45,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 93 [2022-11-18 21:07:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 52 proven. 26 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-11-18 21:07:49,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:07:50,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 87 [2022-11-18 21:07:50,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 51 [2022-11-18 21:07:50,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-11-18 21:07:51,959 INFO L321 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2022-11-18 21:07:51,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 36 [2022-11-18 21:07:52,634 INFO L321 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2022-11-18 21:07:52,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 283 treesize of output 1 [2022-11-18 21:07:52,653 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-18 21:07:52,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 57 [2022-11-18 21:07:52,664 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-18 21:07:52,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 26 [2022-11-18 21:07:52,782 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-11-18 21:07:52,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075103052] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:07:52,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 21:07:52,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 20, 17] total 84 [2022-11-18 21:07:52,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805013947] [2022-11-18 21:07:52,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 21:07:52,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-11-18 21:07:52,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:52,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-11-18 21:07:52,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=6664, Unknown=6, NotChecked=0, Total=6972 [2022-11-18 21:07:52,786 INFO L87 Difference]: Start difference. First operand 2293 states and 3094 transitions. Second operand has 84 states, 73 states have (on average 3.780821917808219) internal successors, (276), 62 states have internal predecessors, (276), 25 states have call successors, (63), 7 states have call predecessors, (63), 23 states have return successors, (68), 28 states have call predecessors, (68), 25 states have call successors, (68) [2022-11-18 21:09:06,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:09:06,921 INFO L93 Difference]: Finished difference Result 5359 states and 7506 transitions. [2022-11-18 21:09:06,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-11-18 21:09:06,922 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 73 states have (on average 3.780821917808219) internal successors, (276), 62 states have internal predecessors, (276), 25 states have call successors, (63), 7 states have call predecessors, (63), 23 states have return successors, (68), 28 states have call predecessors, (68), 25 states have call successors, (68) Word has length 280 [2022-11-18 21:09:06,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:09:06,937 INFO L225 Difference]: With dead ends: 5359 [2022-11-18 21:09:06,937 INFO L226 Difference]: Without dead ends: 3383 [2022-11-18 21:09:06,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 624 SyntacticMatches, 4 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4212 ImplicationChecksByTransitivity, 43.9s TimeCoverageRelationStatistics Valid=1246, Invalid=18763, Unknown=13, NotChecked=0, Total=20022 [2022-11-18 21:09:06,948 INFO L413 NwaCegarLoop]: 794 mSDtfsCounter, 1547 mSDsluCounter, 24533 mSDsCounter, 0 mSdLazyCounter, 26759 mSolverCounterSat, 1014 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1631 SdHoareTripleChecker+Valid, 25327 SdHoareTripleChecker+Invalid, 30677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1014 IncrementalHoareTripleChecker+Valid, 26759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2904 IncrementalHoareTripleChecker+Unchecked, 50.4s IncrementalHoareTripleChecker+Time [2022-11-18 21:09:06,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1631 Valid, 25327 Invalid, 30677 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1014 Valid, 26759 Invalid, 0 Unknown, 2904 Unchecked, 50.4s Time] [2022-11-18 21:09:06,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3383 states. [2022-11-18 21:09:07,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3383 to 2304. [2022-11-18 21:09:07,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2304 states, 1645 states have (on average 1.2103343465045593) internal successors, (1991), 1685 states have internal predecessors, (1991), 480 states have call successors, (480), 172 states have call predecessors, (480), 178 states have return successors, (578), 469 states have call predecessors, (578), 478 states have call successors, (578) [2022-11-18 21:09:07,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 3049 transitions. [2022-11-18 21:09:07,174 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 3049 transitions. Word has length 280 [2022-11-18 21:09:07,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:09:07,175 INFO L495 AbstractCegarLoop]: Abstraction has 2304 states and 3049 transitions. [2022-11-18 21:09:07,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 73 states have (on average 3.780821917808219) internal successors, (276), 62 states have internal predecessors, (276), 25 states have call successors, (63), 7 states have call predecessors, (63), 23 states have return successors, (68), 28 states have call predecessors, (68), 25 states have call successors, (68) [2022-11-18 21:09:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 3049 transitions. [2022-11-18 21:09:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2022-11-18 21:09:07,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:09:07,181 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:09:07,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-18 21:09:07,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-18 21:09:07,395 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:09:07,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:09:07,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1289811898, now seen corresponding path program 1 times [2022-11-18 21:09:07,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:09:07,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478933997] [2022-11-18 21:09:07,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:07,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:09:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 21:09:09,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 21:09:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 21:09:12,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 21:09:12,950 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 21:09:12,951 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-18 21:09:12,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-18 21:09:12,957 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:09:12,963 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 21:09:13,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:09:13 BoogieIcfgContainer [2022-11-18 21:09:13,244 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 21:09:13,245 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 21:09:13,245 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 21:09:13,245 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 21:09:13,245 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:01:30" (3/4) ... [2022-11-18 21:09:13,248 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-18 21:09:13,249 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 21:09:13,250 INFO L158 Benchmark]: Toolchain (without parser) took 468817.67ms. Allocated memory was 151.0MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 114.6MB in the beginning and 1.1GB in the end (delta: -998.5MB). Peak memory consumption was 720.5MB. Max. memory is 16.1GB. [2022-11-18 21:09:13,250 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 100.7MB. Free memory is still 54.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 21:09:13,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2751.05ms. Allocated memory was 151.0MB in the beginning and 234.9MB in the end (delta: 83.9MB). Free memory was 114.6MB in the beginning and 150.0MB in the end (delta: -35.5MB). Peak memory consumption was 92.9MB. Max. memory is 16.1GB. [2022-11-18 21:09:13,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 232.72ms. Allocated memory is still 234.9MB. Free memory was 150.0MB in the beginning and 139.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 21:09:13,252 INFO L158 Benchmark]: Boogie Preprocessor took 188.06ms. Allocated memory is still 234.9MB. Free memory was 139.6MB in the beginning and 127.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 21:09:13,253 INFO L158 Benchmark]: RCFGBuilder took 3333.82ms. Allocated memory is still 234.9MB. Free memory was 127.0MB in the beginning and 149.5MB in the end (delta: -22.5MB). Peak memory consumption was 91.7MB. Max. memory is 16.1GB. [2022-11-18 21:09:13,257 INFO L158 Benchmark]: TraceAbstraction took 462296.32ms. Allocated memory was 234.9MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 148.5MB in the beginning and 1.1GB in the end (delta: -965.7MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-11-18 21:09:13,257 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 1.9GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 21:09:13,262 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.32ms. Allocated memory is still 100.7MB. Free memory is still 54.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2751.05ms. Allocated memory was 151.0MB in the beginning and 234.9MB in the end (delta: 83.9MB). Free memory was 114.6MB in the beginning and 150.0MB in the end (delta: -35.5MB). Peak memory consumption was 92.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 232.72ms. Allocated memory is still 234.9MB. Free memory was 150.0MB in the beginning and 139.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 188.06ms. Allocated memory is still 234.9MB. Free memory was 139.6MB in the beginning and 127.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 3333.82ms. Allocated memory is still 234.9MB. Free memory was 127.0MB in the beginning and 149.5MB in the end (delta: -22.5MB). Peak memory consumption was 91.7MB. Max. memory is 16.1GB. * TraceAbstraction took 462296.32ms. Allocated memory was 234.9MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 148.5MB in the beginning and 1.1GB in the end (delta: -965.7MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 1.9GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 6635, overapproximation of bitwiseOr at line 5696, overapproximation of shiftLeft at line 5141, overapproximation of bitwiseAnd at line 4928. Possible FailurePath: [L5198-L5202] static char const __mod_license65[12] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )'\000'}; [L6764] static int res_catc_open_15 ; [L6231-L6269] static struct net_device_ops const catc_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & catc_open, & catc_stop, & catc_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, & catc_set_multicast_list, & eth_mac_addr, & eth_validate_addr, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, & eth_change_mtu, (int (*)(struct net_device *dev , struct neigh_parms * ))0, & catc_tx_timeout, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6684-L6692] static struct usb_device_id catc_id_table[3] = { {(__u16 )3, (__u16 )1059, (__u16 )10, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )1059, (__u16 )12, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )2257, (__u16 )1, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6271] static struct lock_class_key __key___10 ; [L6270] static struct lock_class_key __key___9 ; [L6763] int LDV_IN_INTERRUPT ; [L6766] static int res_catc_probe_17 ; [L5182-L5197] static char const __mod_description64[53] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'T', (char const )'C', (char const )' ', (char const )'E', (char const )'L', (char const )'1', (char const )'2', (char const )'1', (char const )'0', (char const )'A', (char const )' ', (char const )'N', (char const )'e', (char const )'t', (char const )'M', (char const )'a', (char const )'t', (char const )'e', (char const )' ', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'E', (char const )'t', (char const )'h', (char const )'e', (char const )'r', (char const )'n', (char const )'e', (char const )'t', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )'\000'}; [L6960] int ldv_coherent_state = 0; [L5203-L5204] static char const driver_name[5] = { (char const )'c', (char const )'a', (char const )'t', (char const )'c', (char const )'\000'}; [L6765] static int res_catc_stop_16 ; [L6695-L6710] static struct usb_driver catc_driver = {driver_name, & catc_probe, & catc_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(catc_id_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6129-L6176] static struct ethtool_ops const ops = {& catc_get_settings, (int (*)(struct net_device * , struct ethtool_cmd * ))0, & catc_get_drvinfo, (int (*)(struct net_device * ))0, (void (*)(struct net_device * , struct ethtool_regs * , void * ))0, (void (*)(struct net_device * , struct ethtool_wolinfo * ))0, (int (*)(struct net_device * , struct ethtool_wolinfo * ))0, (u32 (*)(struct net_device * ))0, (void (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * ))0, & ethtool_op_get_link, (int (*)(struct net_device * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (void (*)(struct net_device * , struct ethtool_ringparam * ))0, (int (*)(struct net_device * , struct ethtool_ringparam * ))0, (void (*)(struct net_device * , struct ethtool_pauseparam * ))0, (int (*)(struct net_device * , struct ethtool_pauseparam * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (void (*)(struct net_device * , struct ethtool_test * , u64 * ))0, (void (*)(struct net_device * , u32 stringset , u8 * ))0, (int (*)(struct net_device * , enum ethtool_phys_id_state ))0, (void (*)(struct net_device * , struct ethtool_stats * , u64 * ))0, (int (*)(struct net_device * ))0, (void (*)(struct net_device * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * , int ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * , void * ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * ))0, (int (*)(struct net_device * , struct ethtool_flash * ))0, (int (*)(struct net_device * , u32 * ))0, (int (*)(struct net_device * , struct ethtool_rx_ntuple * ))0, (int (*)(struct net_device * , u32 stringset , void * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir const * ))0, (void (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0, (int (*)(struct net_device * , struct ethtool_dump * , void * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0}; [L6272] static struct lock_class_key __key___11 ; [L6959] int ldv_urb_state = 0; [L5170-L5181] static char const __mod_author63[40] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'V', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )' ', (char const )'P', (char const )'a', (char const )'v', (char const )'l', (char const )'i', (char const )'k', (char const )' ', (char const )'<', (char const )'v', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )'@', (char const )'s', (char const )'u', (char const )'s', (char const )'e', (char const )'.', (char const )'c', (char const )'z', (char const )'>', (char const )'\000'}; VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6768] struct net_device *var_group1 ; [L6769] struct ethtool_drvinfo *var_group2 ; [L6770] struct ethtool_cmd *var_group3 ; [L6771] struct sk_buff *var_group4 ; [L6772] struct usb_interface *var_group5 ; [L6773] struct usb_device_id const *var_catc_probe_17_p1 ; [L6774] unsigned long var_catc_stats_timer_10_p0 ; [L6775] int tmp___7 ; [L6776] int ldv_s_catc_netdev_ops_net_device_ops ; [L6777] int ldv_s_catc_driver_usb_driver ; [L6778] int tmp___8 ; [L6779] int tmp___9 ; [L6782] LDV_IN_INTERRUPT = 1 [L6783] FCALL ldv_initialize() [L6784] CALL, EXPR catc_init() VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6714] int result ; [L6715] int tmp___7 ; [L6718] CALL, EXPR usb_register(& catc_driver) [L5088] int tmp___7 ; [L5091] CALL, EXPR usb_register_driver(driver, & __this_module, "catc") [L7209] return __VERIFIER_nondet_int(); [L5091] RET, EXPR usb_register_driver(driver, & __this_module, "catc") [L5091] tmp___7 = usb_register_driver(driver, & __this_module, "catc") [L5093] return (tmp___7); VAL [\result=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver={30:0}, driver={30:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0] [L6718] RET, EXPR usb_register(& catc_driver) [L6718] tmp___7 = usb_register(& catc_driver) [L6719] result = tmp___7 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, result=0, tmp___7=0] [L6721] COND TRUE result == 0 [L6727] return (result); VAL [\result=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, result=0, tmp___7=0] [L6784] RET, EXPR catc_init() VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_init()=0, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6784] tmp___7 = catc_init() [L6786] COND FALSE !(\read(tmp___7)) [L6790] ldv_s_catc_netdev_ops_net_device_ops = 0 [L6791] ldv_s_catc_driver_usb_driver = 0 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0] [L6793] COND TRUE 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0] [L6796] tmp___9 = __VERIFIER_nondet_int() [L6798] COND TRUE \read(tmp___9) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___9=-2] [L6807] tmp___8 = __VERIFIER_nondet_int() [L6809] COND FALSE !(tmp___8 == 0) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2] [L6812] COND FALSE !(tmp___8 == 1) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2] [L6815] COND FALSE !(tmp___8 == 2) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2] [L6818] COND FALSE !(tmp___8 == 3) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2] [L6821] COND FALSE !(tmp___8 == 4) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2] [L6824] COND FALSE !(tmp___8 == 5) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2] [L6827] COND FALSE !(tmp___8 == 6) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2] [L6830] COND TRUE tmp___8 == 7 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2] [L6895] COND TRUE ldv_s_catc_driver_usb_driver == 0 [L6897] CALL, EXPR catc_probe(var_group5, var_catc_probe_17_p1) [L6274] struct usb_device *usbdev ; [L6275] struct usb_device *tmp___7 ; [L6276] struct net_device *netdev ; [L6277] struct catc *catc ; [L6278] u8 broadcast[6] ; [L6279] int i ; [L6280] int pktsz ; [L6281] int tmp___8 ; [L6282] void *tmp___9 ; [L6283] unsigned int tmp___10 ; [L6284] unsigned int tmp___11 ; [L6285] unsigned int tmp___12 ; [L6286] unsigned int tmp___13 ; [L6287] char const *tmp___14 ; [L6288] int tmp___15 ; [L6291] CALL, EXPR interface_to_usbdev(intf) [L5065] struct device const *__mptr ; [L5067] EXPR intf->dev.parent [L5067] __mptr = (struct device const *)intf->dev.parent [L5068] return ((struct usb_device *)((char *)__mptr - (unsigned int )(& ((struct usb_device *)0)->dev))); VAL [\result={-7:172}, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __mptr={-7:303}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6291] RET, EXPR interface_to_usbdev(intf) [L6291] tmp___7 = interface_to_usbdev(intf) [L6292] usbdev = tmp___7 [L6293] EXPR intf->altsetting [L6293] EXPR (intf->altsetting)->desc.bInterfaceNumber [L6293-L6294] CALL, EXPR usb_set_interface(usbdev, (int )(intf->altsetting)->desc.bInterfaceNumber, 1) [L7213] return __VERIFIER_nondet_int(); [L6293-L6294] RET, EXPR usb_set_interface(usbdev, (int )(intf->altsetting)->desc.bInterfaceNumber, 1) [L6293-L6294] tmp___8 = usb_set_interface(usbdev, (int )(intf->altsetting)->desc.bInterfaceNumber, 1) [L6296] COND FALSE !(\read(tmp___8)) [L6304] CALL, EXPR alloc_etherdev_mqs((int )sizeof(struct catc ), 1U, 1U) [L7117] CALL, EXPR ldv_malloc(sizeof(struct net_device)) VAL [\old(size)=2416, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7117] RET, EXPR ldv_malloc(sizeof(struct net_device)) VAL [\old(arg0)=70119, \old(arg1)=1, \old(arg2)=1, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, arg0=70119, arg1=1, arg2=1, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct net_device))={33:0}, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7117] return ldv_malloc(sizeof(struct net_device)); [L6304] RET, EXPR alloc_etherdev_mqs((int )sizeof(struct catc ), 1U, 1U) [L6304] netdev = alloc_etherdev_mqs((int )sizeof(struct catc ), 1U, 1U) [L6306] COND FALSE !(! netdev) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, usbdev={-7:172}] [L6311] CALL, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={33:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4928] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [\result={33:126}, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={33:0}, dev={33:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6311] RET, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, netdev_priv((struct net_device const *)netdev)={33:126}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, usbdev={-7:172}] [L6311] tmp___9 = netdev_priv((struct net_device const *)netdev) [L6312] catc = (struct catc *)tmp___9 [L6313] netdev->netdev_ops = & catc_netdev_ops [L6314] netdev->watchdog_timeo = 1250 [L6315] netdev->ethtool_ops = & ops [L6316] catc->usbdev = usbdev [L6317] catc->netdev = netdev VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6320] COND TRUE 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6323] CALL spinlock_check(& catc->tx_lock) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, lock={33:166}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4851] return (& lock->__annonCompField18.rlock); VAL [\result={33:166}, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, lock={33:166}, lock={33:166}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6323] RET spinlock_check(& catc->tx_lock) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, spinlock_check(& catc->tx_lock)={33:166}, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6326] COND TRUE 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6329-L6330] FCALL __raw_spin_lock_init(& catc->tx_lock.__annonCompField18.rlock, "&(&catc->tx_lock)->rlock", & __key___9) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6343] COND TRUE 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6346] CALL spinlock_check(& catc->ctrl_lock) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, lock={33:230}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4851] return (& lock->__annonCompField18.rlock); VAL [\result={33:230}, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, lock={33:230}, lock={33:230}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6346] RET spinlock_check(& catc->ctrl_lock) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, spinlock_check(& catc->ctrl_lock)={33:230}, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6349] COND TRUE 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6352-L6353] FCALL __raw_spin_lock_init(& catc->ctrl_lock.__annonCompField18.rlock, "&(&catc->ctrl_lock)->rlock", & __key___10) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6366] COND TRUE 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6369] FCALL init_timer_key(& catc->timer, "&catc->timer", & __key___11) [L6377] catc->timer.data = (unsigned long )((long )catc) [L6378] catc->timer.function = & catc_stats_timer VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6379] CALL, EXPR usb_alloc_urb(0, 208U) VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_urb_state)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] CALL, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=0, \old(size)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] RET, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-4:0}, ldv_urb_state=0, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] return ldv_malloc(0UL); [L7029] RET, EXPR ldv_undefined_pointer() VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={-4:0}, ldv_urb_state=0, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, arbitrary_memory={-4:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-4:0}] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, \result={-4:0}, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, arbitrary_memory={-4:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-4:0}] [L6379] RET, EXPR usb_alloc_urb(0, 208U) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usb_alloc_urb(0, 208U)={-4:0}, usbdev={-7:172}] [L6379] catc->ctrl_urb = usb_alloc_urb(0, 208U) [L6380] CALL, EXPR usb_alloc_urb(0, 208U) VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_urb_state)=1, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] CALL, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=1, \old(size)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] RET, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=1, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-6:0}, ldv_urb_state=1, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] return ldv_malloc(0UL); [L7029] RET, EXPR ldv_undefined_pointer() VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={-6:0}, ldv_urb_state=1, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, arbitrary_memory={-6:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-6:0}] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, \result={-6:0}, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, arbitrary_memory={-6:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-6:0}] [L6380] RET, EXPR usb_alloc_urb(0, 208U) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usb_alloc_urb(0, 208U)={-6:0}, usbdev={-7:172}] [L6380] catc->tx_urb = usb_alloc_urb(0, 208U) [L6381] CALL, EXPR usb_alloc_urb(0, 208U) VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_urb_state)=2, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] CALL, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=2, \old(size)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] RET, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=2, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-7:0}, ldv_urb_state=2, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] return ldv_malloc(0UL); [L7029] RET, EXPR ldv_undefined_pointer() VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={-7:0}, ldv_urb_state=2, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, arbitrary_memory={-7:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:0}] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, \result={-7:0}, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, arbitrary_memory={-7:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:0}] [L6381] RET, EXPR usb_alloc_urb(0, 208U) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usb_alloc_urb(0, 208U)={-7:0}, usbdev={-7:172}] [L6381] catc->rx_urb = usb_alloc_urb(0, 208U) [L6382] CALL, EXPR usb_alloc_urb(0, 208U) VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_urb_state)=3, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] CALL, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=3, \old(size)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] RET, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=3, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-8:0}, ldv_urb_state=3, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] return ldv_malloc(0UL); [L7029] RET, EXPR ldv_undefined_pointer() VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={-8:0}, ldv_urb_state=3, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, arbitrary_memory={-8:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:0}] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, \result={-8:0}, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, arbitrary_memory={-8:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, mem_flags=208, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:0}] [L6382] RET, EXPR usb_alloc_urb(0, 208U) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usb_alloc_urb(0, 208U)={-8:0}, usbdev={-7:172}] [L6382] catc->irq_urb = usb_alloc_urb(0, 208U) [L6384] EXPR catc->ctrl_urb VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc->ctrl_urb={-4:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6384] COND FALSE !(! catc->ctrl_urb) [L6387] EXPR catc->tx_urb VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc->tx_urb={-6:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6387] COND FALSE !(! catc->tx_urb) [L6390] EXPR catc->rx_urb VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc->rx_urb={-7:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6390] COND FALSE !(! catc->rx_urb) [L6393] EXPR catc->irq_urb VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc->irq_urb={-8:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6393] COND FALSE !(! catc->irq_urb) [L6406] EXPR usbdev->descriptor.idVendor VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}, usbdev->descriptor.idVendor=70] [L6406] COND FALSE !((int )usbdev->descriptor.idVendor == 1059) [L6429] pktsz = 23070 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6432] CALL, EXPR __create_pipe(usbdev, 0U) VAL [\old(endpoint)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6432] RET, EXPR __create_pipe(usbdev, 0U) VAL [__create_pipe(usbdev, 0U)=33024, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6432] tmp___10 = __create_pipe(usbdev, 0U) [L6433] EXPR catc->ctrl_urb [L6433-L6435] CALL usb_fill_control_urb(catc->ctrl_urb, usbdev, (unsigned int )(2 << 30) | tmp___10, (unsigned char *)((void *)0), (void *)0, 0, & catc_ctrl_done, (void *)catc) [L5103] urb->dev = dev [L5104] urb->pipe = pipe [L5105] urb->setup_packet = setup_packet [L5106] urb->transfer_buffer = transfer_buffer [L5107] urb->transfer_buffer_length = (u32 )buffer_length [L5108] urb->complete = complete_fn [L5109] urb->context = context VAL [\old(buffer_length)=0, \old(pipe)=2147483648, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buffer_length=0, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, complete_fn={-1:13}, complete_fn={-1:13}, context={33:126}, context={33:126}, dev={-7:172}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, pipe=2147483648, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, setup_packet={0:0}, setup_packet={0:0}, transfer_buffer={0:0}, transfer_buffer={0:0}, urb={-4:0}, urb={-4:0}] [L6433-L6435] RET usb_fill_control_urb(catc->ctrl_urb, usbdev, (unsigned int )(2 << 30) | tmp___10, (unsigned char *)((void *)0), (void *)0, 0, & catc_ctrl_done, (void *)catc) [L6436] CALL, EXPR __create_pipe(usbdev, 1U) VAL [\old(endpoint)=1, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6436] RET, EXPR __create_pipe(usbdev, 1U) VAL [__create_pipe(usbdev, 1U)=32768, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6436] tmp___11 = __create_pipe(usbdev, 1U) [L6437] EXPR catc->tx_urb VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc->tx_urb={-6:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6437-L6438] CALL usb_fill_bulk_urb(catc->tx_urb, usbdev, (unsigned int )(3 << 30) | tmp___11, (void *)0, 0, & catc_tx_done, (void *)catc) VAL [\old(buffer_length)=0, \old(pipe)=32768, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, complete_fn={-1:14}, context={33:126}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={0:0}, urb={-6:0}] [L5119] urb->dev = dev [L5120] urb->pipe = pipe [L5121] urb->transfer_buffer = transfer_buffer [L5122] urb->transfer_buffer_length = (u32 )buffer_length [L5123] urb->complete = complete_fn [L5124] urb->context = context VAL [\old(buffer_length)=0, \old(pipe)=32768, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buffer_length=0, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, complete_fn={-1:14}, complete_fn={-1:14}, context={33:126}, context={33:126}, dev={-7:172}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, pipe=32768, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={0:0}, transfer_buffer={0:0}, urb={-6:0}, urb={-6:0}] [L6437-L6438] RET usb_fill_bulk_urb(catc->tx_urb, usbdev, (unsigned int )(3 << 30) | tmp___11, (void *)0, 0, & catc_tx_done, (void *)catc) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc->tx_urb={-6:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6439] CALL, EXPR __create_pipe(usbdev, 1U) VAL [\old(endpoint)=1, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6439] RET, EXPR __create_pipe(usbdev, 1U) VAL [__create_pipe(usbdev, 1U)=32768, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6439] tmp___12 = __create_pipe(usbdev, 1U) [L6440] EXPR catc->rx_urb VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc->rx_urb={-7:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6440-L6441] CALL usb_fill_bulk_urb(catc->rx_urb, usbdev, ((unsigned int )(3 << 30) | tmp___12) | 128U, (void *)(catc->rx_buf), pktsz, & catc_rx_done, (void *)catc) VAL [\old(buffer_length)=23070, \old(pipe)=128, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, complete_fn={-1:15}, context={33:126}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:46434}, urb={-7:0}] [L5119] urb->dev = dev [L5120] urb->pipe = pipe [L5121] urb->transfer_buffer = transfer_buffer [L5122] urb->transfer_buffer_length = (u32 )buffer_length [L5123] urb->complete = complete_fn [L5124] urb->context = context VAL [\old(buffer_length)=23070, \old(pipe)=128, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buffer_length=23070, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, complete_fn={-1:15}, complete_fn={-1:15}, context={33:126}, context={33:126}, dev={-7:172}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, pipe=128, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:46434}, transfer_buffer={33:46434}, urb={-7:0}, urb={-7:0}] [L6440-L6441] RET usb_fill_bulk_urb(catc->rx_urb, usbdev, ((unsigned int )(3 << 30) | tmp___12) | 128U, (void *)(catc->rx_buf), pktsz, & catc_rx_done, (void *)catc) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc->rx_urb={-7:0}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6442] CALL, EXPR __create_pipe(usbdev, 2U) VAL [\old(endpoint)=2, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6442] RET, EXPR __create_pipe(usbdev, 2U) VAL [__create_pipe(usbdev, 2U)=2147483648, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6442] tmp___13 = __create_pipe(usbdev, 2U) [L6443] EXPR catc->irq_urb [L6443-L6444] CALL usb_fill_int_urb(catc->irq_urb, usbdev, ((unsigned int )(1 << 30) | tmp___13) | 128U, (void *)(catc->irq_buf), 2, & catc_irq_done, (void *)catc, 1) [L5134] urb->dev = dev [L5135] urb->pipe = pipe [L5136] urb->transfer_buffer = transfer_buffer [L5137] urb->transfer_buffer_length = (u32 )buffer_length [L5138] urb->complete = complete_fn [L5139] urb->context = context [L5140] EXPR dev->speed VAL [\old(buffer_length)=2, \old(interval)=1, \old(pipe)=128, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buffer_length=2, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, complete_fn={-1:16}, complete_fn={-1:16}, context={33:126}, context={33:126}, dev={-7:172}, dev={-7:172}, dev->speed=4294967299, driver_name={29:0}, interval=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, pipe=128, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:69504}, transfer_buffer={33:69504}, urb={-8:0}, urb={-8:0}] [L5140] COND TRUE (unsigned int )dev->speed == 3U [L5141] urb->interval = 1 << (interval - 1) VAL [\old(buffer_length)=2, \old(interval)=1, \old(pipe)=128, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buffer_length=2, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, complete_fn={-1:16}, complete_fn={-1:16}, context={33:126}, context={33:126}, dev={-7:172}, dev={-7:172}, driver_name={29:0}, interval=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, pipe=128, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:69504}, transfer_buffer={33:69504}, urb={-8:0}, urb={-8:0}] [L5148] urb->start_frame = -1 VAL [\old(buffer_length)=2, \old(interval)=1, \old(pipe)=128, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buffer_length=2, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, complete_fn={-1:16}, complete_fn={-1:16}, context={33:126}, context={33:126}, dev={-7:172}, dev={-7:172}, driver_name={29:0}, interval=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, pipe=128, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:69504}, transfer_buffer={33:69504}, urb={-8:0}, urb={-8:0}] [L6443-L6444] RET usb_fill_int_urb(catc->irq_urb, usbdev, ((unsigned int )(1 << 30) | tmp___13) | 128U, (void *)(catc->irq_buf), 2, & catc_irq_done, (void *)catc, 1) [L6446] EXPR catc->is_f5u011 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc->is_f5u011=74, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6446] COND FALSE !(! catc->is_f5u011) [L6599] COND TRUE 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6607] CALL catc_ctrl_msg(catc, (u8 )0, (u8 )244, (u16 )0, (u16 )0, (void *)0, 0) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={0:0}, buf={0:0}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={31:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, value=0] [L5684] COND FALSE !(\read(dir)) [L5691] EXPR catc->usbdev VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={0:0}, buf={0:0}, catc={33:126}, catc={33:126}, catc->usbdev={-7:172}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={31:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, value=0] [L5691] CALL, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(endpoint)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5691] RET, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(value)=0, __create_pipe(catc->usbdev, 0U)=2147483648, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={0:0}, buf={0:0}, catc={33:126}, catc={33:126}, catc->usbdev={-7:172}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={31:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, value=0] [L5691] tmp___8 = __create_pipe(catc->usbdev, 0U) [L5692] tmp___9 = (unsigned int )(2 << 30) | tmp___8 VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={0:0}, buf={0:0}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={31:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___8=2147483648, tmp___9=2147483648, value=0] [L5696] EXPR catc->usbdev [L5696-L5697] CALL, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] RET, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={0:0}, buf={0:0}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={31:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___8=2147483648, tmp___9=2147483648, value=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={0:0}, buf={0:0}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={31:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___8=2147483648, tmp___9=2147483648, value=0] [L5705] return (tmp___11); VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(value)=0, \result=-1, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={0:0}, buf={0:0}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={31:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___8=2147483648, tmp___9=2147483648, value=0] [L6607] RET catc_ctrl_msg(catc, (u8 )0, (u8 )244, (u16 )0, (u16 )0, (void *)0, 0) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_ctrl_msg(catc, (u8 )0, (u8 )244, (u16 )0, (u16 )0, (void *)0, 0)=-1, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6608] EXPR netdev->dev_addr VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, netdev->dev_addr={18446744073709551678:18446744073709551670}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6608-L6609] CALL catc_ctrl_msg(catc, (u8 )128, (u8 )242, (u16 )0, (u16 )0, (void *)netdev->dev_addr, 6) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={18446744073709551678:18446744073709551670}, buf={18446744073709551678:18446744073709551670}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=128, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={31:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, value=0] [L5684] COND TRUE \read(dir) [L5686] EXPR catc->usbdev VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={18446744073709551678:18446744073709551670}, buf={18446744073709551678:18446744073709551670}, catc={33:126}, catc={33:126}, catc->usbdev={-7:172}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=128, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={31:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, value=0] [L5686] CALL, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(endpoint)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5686] RET, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(value)=0, __create_pipe(catc->usbdev, 0U)=2147483648, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={18446744073709551678:18446744073709551670}, buf={18446744073709551678:18446744073709551670}, catc={33:126}, catc={33:126}, catc->usbdev={-7:172}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=128, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={31:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, value=0] [L5686] tmp___7 = __create_pipe(catc->usbdev, 0U) [L5687] tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={18446744073709551678:18446744073709551670}, buf={18446744073709551678:18446744073709551670}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=128, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={31:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=2147483648, tmp___9=2147483649, value=0] [L5696] EXPR catc->usbdev [L5696-L5697] CALL, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] RET, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={18446744073709551678:18446744073709551670}, buf={18446744073709551678:18446744073709551670}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=128, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={31:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___7=2147483648, tmp___9=2147483649, value=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={18446744073709551678:18446744073709551670}, buf={18446744073709551678:18446744073709551670}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=128, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={31:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___7=2147483648, tmp___9=2147483649, value=0] [L5705] return (tmp___11); VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(value)=0, \result=-1, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={18446744073709551678:18446744073709551670}, buf={18446744073709551678:18446744073709551670}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=128, driver_name={29:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={31:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___7=2147483648, tmp___9=2147483649, value=0] [L6608-L6609] RET catc_ctrl_msg(catc, (u8 )128, (u8 )242, (u16 )0, (u16 )0, (void *)netdev->dev_addr, 6) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_ctrl_msg(catc, (u8 )128, (u8 )242, (u16 )0, (u16 )0, (void *)netdev->dev_addr, 6)=-1, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, netdev->dev_addr={18446744073709551678:18446744073709551670}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6612] COND TRUE 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6620] catc->rxmode[0] = (u8 )11 [L6621] catc->rxmode[1] = (u8 )0 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6622-L6623] CALL catc_ctrl_msg(catc, (u8 )0, (u8 )245, (u16 )0, (u16 )1, (void *)(catc->rxmode), 2) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={33:70239}, buf={33:70239}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={31:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, value=0] [L5684] COND FALSE !(\read(dir)) [L5691] EXPR catc->usbdev VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={33:70239}, buf={33:70239}, catc={33:126}, catc={33:126}, catc->usbdev={-7:172}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={31:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, value=0] [L5691] CALL, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(endpoint)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={-7:172}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5691] RET, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(value)=0, __create_pipe(catc->usbdev, 0U)=2147483648, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={33:70239}, buf={33:70239}, catc={33:126}, catc={33:126}, catc->usbdev={-7:172}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={31:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, value=0] [L5691] tmp___8 = __create_pipe(catc->usbdev, 0U) [L5692] tmp___9 = (unsigned int )(2 << 30) | tmp___8 VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={33:70239}, buf={33:70239}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={31:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___8=2147483648, tmp___9=2147483648, value=0] [L5696] EXPR catc->usbdev [L5696-L5697] CALL, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] RET, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={33:70239}, buf={33:70239}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={31:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___8=2147483648, tmp___9=2147483648, value=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(value)=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={33:70239}, buf={33:70239}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={31:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___8=2147483648, tmp___9=2147483648, value=0] [L5705] return (tmp___11); VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(value)=0, \result=-1, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, buf={33:70239}, buf={33:70239}, catc={33:126}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dir=0, driver_name={29:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={31:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___8=2147483648, tmp___9=2147483648, value=0] [L6622-L6623] RET catc_ctrl_msg(catc, (u8 )0, (u8 )245, (u16 )0, (u16 )1, (void *)(catc->rxmode), 2) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_ctrl_msg(catc, (u8 )0, (u8 )245, (u16 )0, (u16 )1, (void *)(catc->rxmode), 2)=-1, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6627] COND TRUE 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6634] catc->is_f5u011 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc->is_f5u011=74, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6634] COND TRUE catc->is_f5u011 [L6635] tmp___14 = "Belkin F5U011" VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___14={21:0}, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6640] EXPR usbdev->bus [L6640] (usbdev->bus)->bus_name [L6641] netdev->dev_addr [L6642] CALL usb_set_intfdata(intf, (void *)catc) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5059] CALL dev_set_drvdata(& intf->dev, data) [L7138] return __VERIFIER_nondet_int(); [L5059] RET dev_set_drvdata(& intf->dev, data) [L6642] RET usb_set_intfdata(intf, (void *)catc) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, broadcast={53:0}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, i={55:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___14={21:0}, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6643] netdev->dev.parent = & intf->dev [L6644] CALL, EXPR register_netdev(netdev) [L7187] return __VERIFIER_nondet_int(); [L6644] RET, EXPR register_netdev(netdev) [L6644] tmp___15 = register_netdev(netdev) [L6646] COND FALSE !(tmp___15 != 0) [L6658] return (0); [L6658] return (0); [L6658] return (0); VAL [\result=0, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc={33:126}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, id={18446744073709551680:18446744073709551645}, id={18446744073709551680:18446744073709551645}, intf={18446744073709551630:57}, intf={18446744073709551630:57}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={31:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=33024, tmp___11=32768, tmp___12=32768, tmp___13=2147483648, tmp___14={21:0}, tmp___15=0, tmp___7={-7:172}, tmp___8=0, tmp___9={33:126}, usbdev={-7:172}] [L6897] RET, EXPR catc_probe(var_group5, var_catc_probe_17_p1) [L6897] res_catc_probe_17 = catc_probe(var_group5, var_catc_probe_17_p1) [L6898] FCALL ldv_check_return_value(res_catc_probe_17) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2, var_catc_probe_17_p1={18446744073709551680:18446744073709551645}, var_group5={18446744073709551630:57}] [L6900] COND FALSE !(\read(res_catc_probe_17)) [L6904] ldv_s_catc_driver_usb_driver = ldv_s_catc_driver_usb_driver + 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2, var_catc_probe_17_p1={18446744073709551680:18446744073709551645}, var_group5={18446744073709551630:57}] [L6793] COND TRUE 1 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-2, var_catc_probe_17_p1={18446744073709551680:18446744073709551645}, var_group5={18446744073709551630:57}] [L6796] tmp___9 = __VERIFIER_nondet_int() [L6798] COND TRUE \read(tmp___9) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=-9, var_catc_probe_17_p1={18446744073709551680:18446744073709551645}, var_group5={18446744073709551630:57}] [L6807] tmp___8 = __VERIFIER_nondet_int() [L6809] COND FALSE !(tmp___8 == 0) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=-9, var_catc_probe_17_p1={18446744073709551680:18446744073709551645}, var_group5={18446744073709551630:57}] [L6812] COND FALSE !(tmp___8 == 1) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=-9, var_catc_probe_17_p1={18446744073709551680:18446744073709551645}, var_group5={18446744073709551630:57}] [L6815] COND TRUE tmp___8 == 2 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=-9, var_catc_probe_17_p1={18446744073709551680:18446744073709551645}, var_group5={18446744073709551630:57}] [L6852] COND TRUE ldv_s_catc_netdev_ops_net_device_ops == 0 [L6854] CALL, EXPR catc_open(var_group1) [L6178] struct catc *catc ; [L6179] void *tmp___7 ; [L6180] int status ; VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={18446744073709551671:75}, netdev={18446744073709551671:75}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6183] CALL, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={18446744073709551671:75}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4928] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [\result={18446744073709551671:86}, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, dev={18446744073709551671:75}, dev={18446744073709551671:75}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6183] RET, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={18446744073709551671:75}, netdev={18446744073709551671:75}, netdev_priv((struct net_device const *)netdev)={18446744073709551671:86}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6183] tmp___7 = netdev_priv((struct net_device const *)netdev) [L6184] catc = (struct catc *)tmp___7 [L6185] EXPR catc->irq_urb [L6185] EXPR catc->usbdev [L6185] (catc->irq_urb)->dev = catc->usbdev [L6186] EXPR catc->irq_urb VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc={18446744073709551671:86}, catc->irq_urb={18446744073709551665:73}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={18446744073709551671:75}, netdev={18446744073709551671:75}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={18446744073709551671:86}] [L6186] CALL, EXPR usb_submit_urb(catc->irq_urb, 208U) VAL [\old(arg1)=208, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, arg0={18446744073709551665:73}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7217] return __VERIFIER_nondet_int(); [L6186] RET, EXPR usb_submit_urb(catc->irq_urb, 208U) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc={18446744073709551671:86}, catc->irq_urb={18446744073709551665:73}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={18446744073709551671:75}, netdev={18446744073709551671:75}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={18446744073709551671:86}, usb_submit_urb(catc->irq_urb, 208U)=-1] [L6186] status = usb_submit_urb(catc->irq_urb, 208U) [L6188] COND TRUE status < 0 [L6192] return (-1); VAL [\result=-1, __key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc={18446744073709551671:86}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={18446744073709551671:75}, netdev={18446744073709551671:75}, ops={31:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, status=-1, tmp___7={18446744073709551671:86}] [L6854] RET, EXPR catc_open(var_group1) [L6854] res_catc_open_15 = catc_open(var_group1) [L6855] FCALL ldv_check_return_value(res_catc_open_15) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={31:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=-9, var_catc_probe_17_p1={18446744073709551680:18446744073709551645}, var_group1={18446744073709551671:75}, var_group5={18446744073709551630:57}] [L6857] COND TRUE res_catc_open_15 < 0 VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={31:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=-9, var_catc_probe_17_p1={18446744073709551680:18446744073709551645}, var_group1={18446744073709551671:75}, var_group5={18446744073709551630:57}] [L6934] CALL catc_exit() VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] [L6736] FCALL usb_deregister(& catc_driver) [L6934] RET catc_exit() VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={31:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=-9, var_catc_probe_17_p1={18446744073709551680:18446744073709551645}, var_group1={18446744073709551671:75}, var_group5={18446744073709551630:57}] [L6938] CALL ldv_check_final_state() [L7081] COND FALSE !(ldv_urb_state == 0) VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] [L7084] CALL ldv_blast_assert() VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] [L6946] reach_error() VAL [__key___10={27:0}, __key___11={32:0}, __key___9={28:0}, __this_module={18446744073709551658:18446744073709551621}, catc_driver={30:0}, catc_id_table={26:0}, catc_netdev_ops={25:0}, driver_name={29:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={31:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 37 procedures, 544 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 461.9s, OverallIterations: 24, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 295.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25923 SdHoareTripleChecker+Valid, 231.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24548 mSDsluCounter, 131472 SdHoareTripleChecker+Invalid, 215.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 10796 IncrementalHoareTripleChecker+Unchecked, 116420 mSDsCounter, 12962 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 110827 IncrementalHoareTripleChecker+Invalid, 134585 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12962 mSolverCounterUnsat, 15052 mSDtfsCounter, 110827 mSolverCounterSat, 1.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6685 GetRequests, 5905 SyntacticMatches, 56 SemanticMatches, 724 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15792 ImplicationChecksByTransitivity, 118.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3112occurred in iteration=14, InterpolantAutomatonStates: 441, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 2623 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.7s SsaConstructionTime, 16.4s SatisfiabilityAnalysisTime, 129.6s InterpolantComputationTime, 7036 NumberOfCodeBlocks, 7036 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 8829 ConstructedInterpolants, 220 QuantifiedInterpolants, 42985 SizeOfPredicates, 134 NumberOfNonLiveVariables, 35051 ConjunctsInSsa, 606 ConjunctsInUnsatCore, 49 InterpolantComputations, 14 PerfectInterpolantSequences, 6185/6808 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-18 21:09:13,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 21:09:15,738 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 21:09:15,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 21:09:15,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 21:09:15,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 21:09:15,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 21:09:15,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 21:09:15,793 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 21:09:15,796 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 21:09:15,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 21:09:15,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 21:09:15,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 21:09:15,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 21:09:15,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 21:09:15,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 21:09:15,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 21:09:15,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 21:09:15,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 21:09:15,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 21:09:15,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 21:09:15,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 21:09:15,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 21:09:15,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 21:09:15,837 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 21:09:15,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 21:09:15,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 21:09:15,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 21:09:15,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 21:09:15,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 21:09:15,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 21:09:15,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 21:09:15,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 21:09:15,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 21:09:15,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 21:09:15,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 21:09:15,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 21:09:15,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 21:09:15,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 21:09:15,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 21:09:15,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 21:09:15,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 21:09:15,866 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-18 21:09:15,908 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 21:09:15,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 21:09:15,909 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 21:09:15,910 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 21:09:15,911 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 21:09:15,911 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 21:09:15,912 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 21:09:15,913 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 21:09:15,913 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 21:09:15,913 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 21:09:15,914 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 21:09:15,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 21:09:15,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 21:09:15,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 21:09:15,915 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 21:09:15,915 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-18 21:09:15,916 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-18 21:09:15,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 21:09:15,916 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 21:09:15,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 21:09:15,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 21:09:15,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 21:09:15,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 21:09:15,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:09:15,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 21:09:15,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 21:09:15,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 21:09:15,918 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-18 21:09:15,918 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-18 21:09:15,919 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 21:09:15,919 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 21:09:15,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 21:09:15,919 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-18 21:09:15,920 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c [2022-11-18 21:09:16,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 21:09:16,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 21:09:16,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 21:09:16,361 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 21:09:16,362 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 21:09:16,364 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-11-18 21:09:16,431 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/data/b3cc5aee2/c8fb561a43e84a7eaf8c76e57a2f348b/FLAGdfdde9de4 [2022-11-18 21:09:17,267 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 21:09:17,272 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-11-18 21:09:17,331 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/data/b3cc5aee2/c8fb561a43e84a7eaf8c76e57a2f348b/FLAGdfdde9de4 [2022-11-18 21:09:17,776 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/data/b3cc5aee2/c8fb561a43e84a7eaf8c76e57a2f348b [2022-11-18 21:09:17,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 21:09:17,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 21:09:17,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 21:09:17,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 21:09:17,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 21:09:17,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:09:17" (1/1) ... [2022-11-18 21:09:17,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59715e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:17, skipping insertion in model container [2022-11-18 21:09:17,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:09:17" (1/1) ... [2022-11-18 21:09:17,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 21:09:17,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 21:09:19,409 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2022-11-18 21:09:19,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:09:19,572 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-11-18 21:09:19,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 21:09:19,893 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2022-11-18 21:09:19,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:09:19,952 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 21:09:20,163 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2022-11-18 21:09:20,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:09:20,574 INFO L208 MainTranslator]: Completed translation [2022-11-18 21:09:20,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:20 WrapperNode [2022-11-18 21:09:20,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 21:09:20,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 21:09:20,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 21:09:20,576 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 21:09:20,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:20" (1/1) ... [2022-11-18 21:09:20,647 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:20" (1/1) ... [2022-11-18 21:09:20,782 INFO L138 Inliner]: procedures = 157, calls = 839, calls flagged for inlining = 59, calls inlined = 40, statements flattened = 1605 [2022-11-18 21:09:20,782 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 21:09:20,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 21:09:20,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 21:09:20,783 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 21:09:20,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:20" (1/1) ... [2022-11-18 21:09:20,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:20" (1/1) ... [2022-11-18 21:09:20,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:20" (1/1) ... [2022-11-18 21:09:20,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:20" (1/1) ... [2022-11-18 21:09:20,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:20" (1/1) ... [2022-11-18 21:09:20,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:20" (1/1) ... [2022-11-18 21:09:20,951 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:20" (1/1) ... [2022-11-18 21:09:20,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:20" (1/1) ... [2022-11-18 21:09:20,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 21:09:20,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 21:09:20,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 21:09:20,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 21:09:20,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:20" (1/1) ... [2022-11-18 21:09:20,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:09:21,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:09:21,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 21:09:21,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 21:09:21,072 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-11-18 21:09:21,072 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-11-18 21:09:21,072 INFO L130 BoogieDeclarations]: Found specification of procedure catc_tx_run [2022-11-18 21:09:21,072 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_tx_run [2022-11-18 21:09:21,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-18 21:09:21,073 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-11-18 21:09:21,073 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-11-18 21:09:21,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-11-18 21:09:21,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-18 21:09:21,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-18 21:09:21,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-11-18 21:09:21,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-18 21:09:21,074 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-11-18 21:09:21,074 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-11-18 21:09:21,074 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-11-18 21:09:21,074 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-11-18 21:09:21,075 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_run [2022-11-18 21:09:21,075 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_run [2022-11-18 21:09:21,075 INFO L130 BoogieDeclarations]: Found specification of procedure catc_get_drvinfo [2022-11-18 21:09:21,075 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_get_drvinfo [2022-11-18 21:09:21,075 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_msg [2022-11-18 21:09:21,075 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_msg [2022-11-18 21:09:21,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-18 21:09:21,076 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-18 21:09:21,076 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-18 21:09:21,076 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-18 21:09:21,076 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-18 21:09:21,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-18 21:09:21,077 INFO L130 BoogieDeclarations]: Found specification of procedure catc_multicast [2022-11-18 21:09:21,077 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_multicast [2022-11-18 21:09:21,077 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-11-18 21:09:21,077 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-11-18 21:09:21,077 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-11-18 21:09:21,077 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-11-18 21:09:21,078 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-11-18 21:09:21,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-11-18 21:09:21,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-11-18 21:09:21,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2022-11-18 21:09:21,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-11-18 21:09:21,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2022-11-18 21:09:21,079 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-11-18 21:09:21,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-11-18 21:09:21,079 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-11-18 21:09:21,079 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-11-18 21:09:21,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-18 21:09:21,079 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-18 21:09:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-11-18 21:09:21,080 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-11-18 21:09:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 21:09:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2022-11-18 21:09:21,080 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2022-11-18 21:09:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-11-18 21:09:21,081 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-11-18 21:09:21,081 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-11-18 21:09:21,081 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-11-18 21:09:21,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 21:09:21,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 21:09:21,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 21:09:21,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2022-11-18 21:09:21,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2022-11-18 21:09:21,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2022-11-18 21:09:21,082 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_async [2022-11-18 21:09:21,082 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_async [2022-11-18 21:09:21,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 21:09:21,083 INFO L130 BoogieDeclarations]: Found specification of procedure catc_exit [2022-11-18 21:09:21,083 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_exit [2022-11-18 21:09:21,083 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-11-18 21:09:21,083 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-11-18 21:09:21,083 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-11-18 21:09:21,083 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-11-18 21:09:21,084 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-11-18 21:09:21,084 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-11-18 21:09:21,084 INFO L130 BoogieDeclarations]: Found specification of procedure catc_init [2022-11-18 21:09:21,084 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_init [2022-11-18 21:09:21,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-11-18 21:09:21,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-11-18 21:09:21,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-11-18 21:09:21,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-11-18 21:09:21,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-11-18 21:09:21,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 21:09:21,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-18 21:09:21,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 21:09:21,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-11-18 21:09:21,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-18 21:09:21,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-18 21:09:21,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-11-18 21:09:21,086 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-11-18 21:09:21,086 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-11-18 21:09:21,087 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-11-18 21:09:21,087 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-11-18 21:09:21,087 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-11-18 21:09:21,087 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-11-18 21:09:21,087 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-11-18 21:09:21,087 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-11-18 21:09:21,088 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-18 21:09:21,088 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-18 21:09:21,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-11-18 21:09:21,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-11-18 21:09:21,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2022-11-18 21:09:21,088 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-11-18 21:09:21,089 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-11-18 21:09:21,089 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-11-18 21:09:21,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 21:09:21,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 21:09:21,649 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 21:09:21,652 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 21:09:32,438 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-11-18 21:09:32,594 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-18 21:09:32,607 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-18 21:09:44,464 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2022-11-18 21:09:44,464 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2022-11-18 21:09:44,464 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-11-18 21:09:44,464 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-11-18 21:09:44,541 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 21:09:44,563 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 21:09:44,563 INFO L300 CfgBuilder]: Removed 30 assume(true) statements. [2022-11-18 21:09:44,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:09:44 BoogieIcfgContainer [2022-11-18 21:09:44,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 21:09:44,571 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 21:09:44,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 21:09:44,576 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 21:09:44,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:09:17" (1/3) ... [2022-11-18 21:09:44,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ae18e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:09:44, skipping insertion in model container [2022-11-18 21:09:44,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:09:20" (2/3) ... [2022-11-18 21:09:44,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ae18e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:09:44, skipping insertion in model container [2022-11-18 21:09:44,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:09:44" (3/3) ... [2022-11-18 21:09:44,587 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-11-18 21:09:44,608 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 21:09:44,608 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-18 21:09:44,704 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 21:09:44,713 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;@aaa3978, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 21:09:44,713 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-18 21:09:44,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 539 states, 380 states have (on average 1.381578947368421) internal successors, (525), 393 states have internal predecessors, (525), 122 states have call successors, (122), 36 states have call predecessors, (122), 35 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) [2022-11-18 21:09:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 21:09:44,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:09:44,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:09:44,733 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:09:44,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:09:44,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1343427639, now seen corresponding path program 1 times [2022-11-18 21:09:44,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:09:44,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642544311] [2022-11-18 21:09:44,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:44,760 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:09:44,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:09:44,765 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 21:09:44,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-18 21:09:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:45,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 21:09:45,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:09:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:09:45,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:09:45,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:09:45,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642544311] [2022-11-18 21:09:45,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642544311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:09:45,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:09:45,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 21:09:45,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884885419] [2022-11-18 21:09:45,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:09:45,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 21:09:45,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:09:45,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 21:09:45,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 21:09:45,746 INFO L87 Difference]: Start difference. First operand has 539 states, 380 states have (on average 1.381578947368421) internal successors, (525), 393 states have internal predecessors, (525), 122 states have call successors, (122), 36 states have call predecessors, (122), 35 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 21:09:46,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:09:46,062 INFO L93 Difference]: Finished difference Result 1076 states and 1560 transitions. [2022-11-18 21:09:46,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 21:09:46,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-18 21:09:46,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:09:46,085 INFO L225 Difference]: With dead ends: 1076 [2022-11-18 21:09:46,087 INFO L226 Difference]: Without dead ends: 540 [2022-11-18 21:09:46,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:09:46,102 INFO L413 NwaCegarLoop]: 709 mSDtfsCounter, 301 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 3140 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:09:46,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 3140 Invalid, 22 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:09:46,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-11-18 21:09:46,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 535. [2022-11-18 21:09:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 378 states have (on average 1.216931216931217) internal successors, (460), 386 states have internal predecessors, (460), 121 states have call successors, (121), 35 states have call predecessors, (121), 35 states have return successors, (119), 118 states have call predecessors, (119), 118 states have call successors, (119) [2022-11-18 21:09:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 700 transitions. [2022-11-18 21:09:46,248 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 700 transitions. Word has length 17 [2022-11-18 21:09:46,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:09:46,248 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 700 transitions. [2022-11-18 21:09:46,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 21:09:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 700 transitions. [2022-11-18 21:09:46,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-18 21:09:46,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:09:46,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:09:46,278 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-18 21:09:46,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:09:46,466 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:09:46,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:09:46,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1736454649, now seen corresponding path program 1 times [2022-11-18 21:09:46,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:09:46,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548750029] [2022-11-18 21:09:46,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:46,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:09:46,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:09:46,475 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 21:09:46,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-18 21:09:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:47,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 21:09:47,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:09:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:09:47,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:09:47,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:09:47,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548750029] [2022-11-18 21:09:47,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548750029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:09:47,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:09:47,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 21:09:47,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045231028] [2022-11-18 21:09:47,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:09:47,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 21:09:47,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:09:47,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 21:09:47,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:09:47,284 INFO L87 Difference]: Start difference. First operand 535 states and 700 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 21:09:47,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:09:47,433 INFO L93 Difference]: Finished difference Result 1565 states and 2072 transitions. [2022-11-18 21:09:47,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 21:09:47,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-18 21:09:47,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:09:47,449 INFO L225 Difference]: With dead ends: 1565 [2022-11-18 21:09:47,449 INFO L226 Difference]: Without dead ends: 1048 [2022-11-18 21:09:47,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:09:47,454 INFO L413 NwaCegarLoop]: 973 mSDtfsCounter, 676 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:09:47,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1649 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 21:09:47,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2022-11-18 21:09:47,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1045. [2022-11-18 21:09:47,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 738 states have (on average 1.2168021680216803) internal successors, (898), 751 states have internal predecessors, (898), 238 states have call successors, (238), 68 states have call predecessors, (238), 68 states have return successors, (240), 234 states have call predecessors, (240), 235 states have call successors, (240) [2022-11-18 21:09:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1376 transitions. [2022-11-18 21:09:47,603 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1376 transitions. Word has length 17 [2022-11-18 21:09:47,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:09:47,603 INFO L495 AbstractCegarLoop]: Abstraction has 1045 states and 1376 transitions. [2022-11-18 21:09:47,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 21:09:47,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1376 transitions. [2022-11-18 21:09:47,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 21:09:47,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:09:47,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:09:47,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-18 21:09:47,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:09:47,819 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:09:47,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:09:47,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2004221234, now seen corresponding path program 1 times [2022-11-18 21:09:47,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:09:47,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974338646] [2022-11-18 21:09:47,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:47,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:09:47,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:09:47,823 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 21:09:47,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-18 21:09:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:48,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 21:09:48,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:09:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:09:48,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:09:48,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:09:48,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974338646] [2022-11-18 21:09:48,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974338646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:09:48,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:09:48,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 21:09:48,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164022376] [2022-11-18 21:09:48,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:09:48,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 21:09:48,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:09:48,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 21:09:48,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:09:48,593 INFO L87 Difference]: Start difference. First operand 1045 states and 1376 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 21:09:48,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:09:48,682 INFO L93 Difference]: Finished difference Result 1047 states and 1377 transitions. [2022-11-18 21:09:48,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 21:09:48,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-11-18 21:09:48,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:09:48,690 INFO L225 Difference]: With dead ends: 1047 [2022-11-18 21:09:48,690 INFO L226 Difference]: Without dead ends: 1036 [2022-11-18 21:09:48,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:09:48,695 INFO L413 NwaCegarLoop]: 693 mSDtfsCounter, 678 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 21:09:48,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 21:09:48,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2022-11-18 21:09:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1031. [2022-11-18 21:09:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 728 states have (on average 1.2115384615384615) internal successors, (882), 739 states have internal predecessors, (882), 236 states have call successors, (236), 67 states have call predecessors, (236), 66 states have return successors, (238), 232 states have call predecessors, (238), 234 states have call successors, (238) [2022-11-18 21:09:48,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1356 transitions. [2022-11-18 21:09:48,818 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1356 transitions. Word has length 18 [2022-11-18 21:09:48,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:09:48,818 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 1356 transitions. [2022-11-18 21:09:48,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 21:09:48,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1356 transitions. [2022-11-18 21:09:48,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-18 21:09:48,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:09:48,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:09:48,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-18 21:09:49,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:09:49,046 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:09:49,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:09:49,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1305048404, now seen corresponding path program 1 times [2022-11-18 21:09:49,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:09:49,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868543744] [2022-11-18 21:09:49,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:49,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:09:49,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:09:49,052 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 21:09:49,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-18 21:09:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:49,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-18 21:09:49,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:09:49,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:09:49,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:09:49,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:09:49,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868543744] [2022-11-18 21:09:49,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868543744] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:09:49,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:09:49,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 21:09:49,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046706871] [2022-11-18 21:09:49,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:09:49,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 21:09:49,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:09:49,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 21:09:49,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:09:49,787 INFO L87 Difference]: Start difference. First operand 1031 states and 1356 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 21:09:49,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:09:49,967 INFO L93 Difference]: Finished difference Result 2353 states and 3158 transitions. [2022-11-18 21:09:49,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 21:09:49,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2022-11-18 21:09:49,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:09:49,976 INFO L225 Difference]: With dead ends: 2353 [2022-11-18 21:09:49,977 INFO L226 Difference]: Without dead ends: 1334 [2022-11-18 21:09:49,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:09:49,983 INFO L413 NwaCegarLoop]: 802 mSDtfsCounter, 262 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:09:49,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1321 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:09:49,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2022-11-18 21:09:50,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1330. [2022-11-18 21:09:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 945 states have (on average 1.2338624338624338) internal successors, (1166), 964 states have internal predecessors, (1166), 318 states have call successors, (318), 67 states have call predecessors, (318), 66 states have return successors, (320), 312 states have call predecessors, (320), 316 states have call successors, (320) [2022-11-18 21:09:50,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1804 transitions. [2022-11-18 21:09:50,124 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1804 transitions. Word has length 50 [2022-11-18 21:09:50,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:09:50,125 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1804 transitions. [2022-11-18 21:09:50,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 21:09:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1804 transitions. [2022-11-18 21:09:50,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-18 21:09:50,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:09:50,129 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-18 21:09:50,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-18 21:09:50,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:09:50,350 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:09:50,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:09:50,351 INFO L85 PathProgramCache]: Analyzing trace with hash -518166049, now seen corresponding path program 1 times [2022-11-18 21:09:50,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:09:50,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473777154] [2022-11-18 21:09:50,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:50,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:09:50,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:09:50,356 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 21:09:50,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-18 21:09:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:51,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 21:09:51,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:09:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:09:51,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:09:51,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:09:51,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473777154] [2022-11-18 21:09:51,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473777154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:09:51,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:09:51,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 21:09:51,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37208420] [2022-11-18 21:09:51,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:09:51,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:09:51,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:09:51,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:09:51,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:09:51,138 INFO L87 Difference]: Start difference. First operand 1330 states and 1804 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-18 21:09:51,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:09:51,498 INFO L93 Difference]: Finished difference Result 2669 states and 3616 transitions. [2022-11-18 21:09:51,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 21:09:51,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 72 [2022-11-18 21:09:51,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:09:51,507 INFO L225 Difference]: With dead ends: 2669 [2022-11-18 21:09:51,507 INFO L226 Difference]: Without dead ends: 1343 [2022-11-18 21:09:51,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 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-18 21:09:51,513 INFO L413 NwaCegarLoop]: 698 mSDtfsCounter, 12 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 21:09:51,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2075 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 21:09:51,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-11-18 21:09:51,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1333. [2022-11-18 21:09:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 947 states have (on average 1.232312565997888) internal successors, (1167), 967 states have internal predecessors, (1167), 318 states have call successors, (318), 68 states have call predecessors, (318), 67 states have return successors, (319), 311 states have call predecessors, (319), 315 states have call successors, (319) [2022-11-18 21:09:51,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1804 transitions. [2022-11-18 21:09:51,622 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1804 transitions. Word has length 72 [2022-11-18 21:09:51,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:09:51,623 INFO L495 AbstractCegarLoop]: Abstraction has 1333 states and 1804 transitions. [2022-11-18 21:09:51,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-18 21:09:51,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1804 transitions. [2022-11-18 21:09:51,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-18 21:09:51,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:09:51,626 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-18 21:09:51,652 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-18 21:09:51,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:09:51,842 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:09:51,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:09:51,842 INFO L85 PathProgramCache]: Analyzing trace with hash -84772232, now seen corresponding path program 1 times [2022-11-18 21:09:51,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:09:51,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135560638] [2022-11-18 21:09:51,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:51,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:09:51,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:09:51,846 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 21:09:51,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-18 21:09:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:52,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 21:09:52,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:09:52,649 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:09:52,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:09:52,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:09:52,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135560638] [2022-11-18 21:09:52,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135560638] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:09:52,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:09:52,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 21:09:52,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979203664] [2022-11-18 21:09:52,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:09:52,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 21:09:52,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:09:52,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 21:09:52,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 21:09:52,651 INFO L87 Difference]: Start difference. First operand 1333 states and 1804 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-18 21:09:53,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:09:53,015 INFO L93 Difference]: Finished difference Result 2675 states and 3616 transitions. [2022-11-18 21:09:53,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 21:09:53,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 80 [2022-11-18 21:09:53,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:09:53,024 INFO L225 Difference]: With dead ends: 2675 [2022-11-18 21:09:53,024 INFO L226 Difference]: Without dead ends: 1346 [2022-11-18 21:09:53,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 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-18 21:09:53,031 INFO L413 NwaCegarLoop]: 690 mSDtfsCounter, 12 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2062 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 21:09:53,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2062 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 21:09:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2022-11-18 21:09:53,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1330. [2022-11-18 21:09:53,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 945 states have (on average 1.2317460317460318) internal successors, (1164), 966 states have internal predecessors, (1164), 317 states have call successors, (317), 68 states have call predecessors, (317), 67 states have return successors, (317), 309 states have call predecessors, (317), 313 states have call successors, (317) [2022-11-18 21:09:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1798 transitions. [2022-11-18 21:09:53,153 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1798 transitions. Word has length 80 [2022-11-18 21:09:53,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:09:53,154 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1798 transitions. [2022-11-18 21:09:53,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-18 21:09:53,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1798 transitions. [2022-11-18 21:09:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-11-18 21:09:53,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:09:53,163 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-18 21:09:53,186 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-11-18 21:09:53,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:09:53,384 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:09:53,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:09:53,384 INFO L85 PathProgramCache]: Analyzing trace with hash -2140419496, now seen corresponding path program 1 times [2022-11-18 21:09:53,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:09:53,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771151063] [2022-11-18 21:09:53,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:53,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:09:53,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:09:53,387 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 21:09:53,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-18 21:09:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:54,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 21:09:54,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:09:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-18 21:09:54,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:09:54,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:09:54,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771151063] [2022-11-18 21:09:54,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771151063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:09:54,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:09:54,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 21:09:54,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596789274] [2022-11-18 21:09:54,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:09:54,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 21:09:54,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:09:54,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 21:09:54,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 21:09:54,462 INFO L87 Difference]: Start difference. First operand 1330 states and 1798 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-18 21:09:56,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:09:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:09:56,408 INFO L93 Difference]: Finished difference Result 2671 states and 3615 transitions. [2022-11-18 21:09:56,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 21:09:56,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 146 [2022-11-18 21:09:56,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:09:56,417 INFO L225 Difference]: With dead ends: 2671 [2022-11-18 21:09:56,417 INFO L226 Difference]: Without dead ends: 1351 [2022-11-18 21:09:56,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:09:56,423 INFO L413 NwaCegarLoop]: 699 mSDtfsCounter, 15 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3468 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-18 21:09:56,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3468 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-18 21:09:56,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-11-18 21:09:56,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1337. [2022-11-18 21:09:56,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 950 states have (on average 1.2305263157894737) internal successors, (1169), 972 states have internal predecessors, (1169), 317 states have call successors, (317), 68 states have call predecessors, (317), 69 states have return successors, (322), 310 states have call predecessors, (322), 313 states have call successors, (322) [2022-11-18 21:09:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1808 transitions. [2022-11-18 21:09:56,530 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1808 transitions. Word has length 146 [2022-11-18 21:09:56,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:09:56,532 INFO L495 AbstractCegarLoop]: Abstraction has 1337 states and 1808 transitions. [2022-11-18 21:09:56,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-18 21:09:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1808 transitions. [2022-11-18 21:09:56,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-11-18 21:09:56,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:09:56,539 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-18 21:09:56,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-18 21:09:56,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:09:56,755 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:09:56,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:09:56,756 INFO L85 PathProgramCache]: Analyzing trace with hash 971530265, now seen corresponding path program 1 times [2022-11-18 21:09:56,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:09:56,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122865234] [2022-11-18 21:09:56,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:09:56,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:09:56,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:09:56,758 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 21:09:56,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-18 21:09:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:09:57,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-18 21:09:57,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:09:57,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-18 21:09:57,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-18 21:09:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-18 21:09:58,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:09:58,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:09:58,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122865234] [2022-11-18 21:09:58,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [122865234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:09:58,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:09:58,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:09:58,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179415887] [2022-11-18 21:09:58,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:09:58,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:09:58,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:09:58,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:09:58,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:09:58,026 INFO L87 Difference]: Start difference. First operand 1337 states and 1808 transitions. Second operand has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-18 21:10:00,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:02,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:04,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:06,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:08,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:10,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:12,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:14,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:16,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:18,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:21,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:23,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:26,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:28,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:30,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:32,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:35,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:37,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:39,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:41,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:43,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:45,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:10:46,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:10:46,948 INFO L93 Difference]: Finished difference Result 1399 states and 1888 transitions. [2022-11-18 21:10:46,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 21:10:46,950 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 146 [2022-11-18 21:10:46,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:10:46,961 INFO L225 Difference]: With dead ends: 1399 [2022-11-18 21:10:46,962 INFO L226 Difference]: Without dead ends: 1339 [2022-11-18 21:10:46,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-18 21:10:46,964 INFO L413 NwaCegarLoop]: 687 mSDtfsCounter, 4 mSDsluCounter, 3176 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3863 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.7s IncrementalHoareTripleChecker+Time [2022-11-18 21:10:46,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3863 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 260 Invalid, 20 Unknown, 0 Unchecked, 48.7s Time] [2022-11-18 21:10:46,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2022-11-18 21:10:47,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2022-11-18 21:10:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 950 states have (on average 1.2284210526315789) internal successors, (1167), 972 states have internal predecessors, (1167), 317 states have call successors, (317), 68 states have call predecessors, (317), 69 states have return successors, (322), 310 states have call predecessors, (322), 313 states have call successors, (322) [2022-11-18 21:10:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1806 transitions. [2022-11-18 21:10:47,090 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1806 transitions. Word has length 146 [2022-11-18 21:10:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:10:47,091 INFO L495 AbstractCegarLoop]: Abstraction has 1337 states and 1806 transitions. [2022-11-18 21:10:47,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-11-18 21:10:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1806 transitions. [2022-11-18 21:10:47,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-18 21:10:47,095 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:10:47,095 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-18 21:10:47,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-18 21:10:47,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:10:47,311 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:10:47,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:47,312 INFO L85 PathProgramCache]: Analyzing trace with hash -480950281, now seen corresponding path program 1 times [2022-11-18 21:10:47,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:10:47,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129756117] [2022-11-18 21:10:47,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:47,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:10:47,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:10:47,314 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 21:10:47,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-18 21:10:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:54,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-18 21:10:54,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:10:54,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 21:10:54,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 21:10:54,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 21:10:54,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 21:10:55,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 21:10:55,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 21:10:55,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-18 21:10:55,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-18 21:10:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-18 21:10:55,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:10:56,369 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-18 21:10:56,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:10:56,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129756117] [2022-11-18 21:10:56,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129756117] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:10:56,370 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 21:10:56,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2022-11-18 21:10:56,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135986771] [2022-11-18 21:10:56,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 21:10:56,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:10:56,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:10:56,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:10:56,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:10:56,375 INFO L87 Difference]: Start difference. First operand 1337 states and 1806 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-18 21:10:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:10:56,825 INFO L93 Difference]: Finished difference Result 2386 states and 3197 transitions. [2022-11-18 21:10:56,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 21:10:56,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2022-11-18 21:10:56,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:10:56,834 INFO L225 Difference]: With dead ends: 2386 [2022-11-18 21:10:56,835 INFO L226 Difference]: Without dead ends: 1008 [2022-11-18 21:10:56,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 282 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 21:10:56,843 INFO L413 NwaCegarLoop]: 702 mSDtfsCounter, 2 mSDsluCounter, 2706 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3408 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 21:10:56,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3408 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 100 Unchecked, 0.2s Time] [2022-11-18 21:10:56,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2022-11-18 21:10:56,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1008. [2022-11-18 21:10:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 717 states have (on average 1.2259414225941423) internal successors, (879), 734 states have internal predecessors, (879), 226 states have call successors, (226), 63 states have call predecessors, (226), 64 states have return successors, (231), 221 states have call predecessors, (231), 224 states have call successors, (231) [2022-11-18 21:10:56,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1336 transitions. [2022-11-18 21:10:56,936 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1336 transitions. Word has length 147 [2022-11-18 21:10:56,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:10:56,938 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 1336 transitions. [2022-11-18 21:10:56,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-18 21:10:56,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1336 transitions. [2022-11-18 21:10:56,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-18 21:10:56,942 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:10:56,942 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:56,986 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-18 21:10:57,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:10:57,169 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:10:57,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:57,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1300549654, now seen corresponding path program 1 times [2022-11-18 21:10:57,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:10:57,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405278404] [2022-11-18 21:10:57,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:10:57,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:10:57,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:10:57,174 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 21:10:57,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-18 21:10:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:10:58,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-18 21:10:58,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:10:58,637 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-11-18 21:10:58,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 21:10:58,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:10:58,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405278404] [2022-11-18 21:10:58,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405278404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:10:58,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:10:58,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:10:58,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001048252] [2022-11-18 21:10:58,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:10:58,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:10:58,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:10:58,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:10:58,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:10:58,641 INFO L87 Difference]: Start difference. First operand 1008 states and 1336 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-18 21:10:58,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:10:58,820 INFO L93 Difference]: Finished difference Result 1696 states and 2271 transitions. [2022-11-18 21:10:58,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 21:10:58,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) Word has length 147 [2022-11-18 21:10:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:10:58,827 INFO L225 Difference]: With dead ends: 1696 [2022-11-18 21:10:58,828 INFO L226 Difference]: Without dead ends: 1011 [2022-11-18 21:10:58,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:10:58,832 INFO L413 NwaCegarLoop]: 689 mSDtfsCounter, 2 mSDsluCounter, 3436 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4125 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:10:58,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4125 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 21:10:58,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2022-11-18 21:10:58,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2022-11-18 21:10:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 720 states have (on average 1.2236111111111112) internal successors, (881), 735 states have internal predecessors, (881), 226 states have call successors, (226), 63 states have call predecessors, (226), 64 states have return successors, (231), 223 states have call predecessors, (231), 224 states have call successors, (231) [2022-11-18 21:10:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1338 transitions. [2022-11-18 21:10:58,929 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1338 transitions. Word has length 147 [2022-11-18 21:10:58,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:10:58,929 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 1338 transitions. [2022-11-18 21:10:58,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-18 21:10:58,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1338 transitions. [2022-11-18 21:10:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-18 21:10:58,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:10:58,933 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:10:58,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-18 21:10:59,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:10:59,147 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:10:59,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:10:59,148 INFO L85 PathProgramCache]: Analyzing trace with hash 345028375, now seen corresponding path program 2 times [2022-11-18 21:10:59,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:10:59,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832269925] [2022-11-18 21:10:59,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 21:10:59,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:10:59,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:10:59,151 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 21:10:59,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-18 21:11:01,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 21:11:01,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 21:11:01,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-18 21:11:01,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:11:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-11-18 21:11:02,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:11:03,727 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-11-18 21:11:03,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:11:03,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832269925] [2022-11-18 21:11:03,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832269925] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:11:03,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 21:11:03,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2022-11-18 21:11:03,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338063836] [2022-11-18 21:11:03,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 21:11:03,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 21:11:03,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:11:03,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 21:11:03,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-18 21:11:03,731 INFO L87 Difference]: Start difference. First operand 1011 states and 1338 transitions. Second operand has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 11 states have internal predecessors, (145), 9 states have call successors, (29), 8 states have call predecessors, (29), 6 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2022-11-18 21:11:06,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:11:09,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:11:12,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:11:15,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:11:18,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:11:20,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:11:22,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:11:24,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:11:26,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:11:28,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:11:30,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:11:32,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:11:35,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:11:40,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:11:45,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:11:48,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:11:58,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:12:03,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:12:03,023 INFO L93 Difference]: Finished difference Result 4364 states and 5882 transitions. [2022-11-18 21:12:03,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 21:12:03,024 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 11 states have internal predecessors, (145), 9 states have call successors, (29), 8 states have call predecessors, (29), 6 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) Word has length 147 [2022-11-18 21:12:03,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:12:03,041 INFO L225 Difference]: With dead ends: 4364 [2022-11-18 21:12:03,042 INFO L226 Difference]: Without dead ends: 3642 [2022-11-18 21:12:03,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2022-11-18 21:12:03,046 INFO L413 NwaCegarLoop]: 1651 mSDtfsCounter, 4009 mSDsluCounter, 4202 mSDsCounter, 0 mSdLazyCounter, 5971 mSolverCounterSat, 1988 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4287 SdHoareTripleChecker+Valid, 5853 SdHoareTripleChecker+Invalid, 7972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1988 IncrementalHoareTripleChecker+Valid, 5971 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.4s IncrementalHoareTripleChecker+Time [2022-11-18 21:12:03,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4287 Valid, 5853 Invalid, 7972 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1988 Valid, 5971 Invalid, 13 Unknown, 0 Unchecked, 58.4s Time] [2022-11-18 21:12:03,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3642 states. [2022-11-18 21:12:03,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3642 to 3520. [2022-11-18 21:12:03,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3520 states, 2495 states have (on average 1.2244488977955912) internal successors, (3055), 2553 states have internal predecessors, (3055), 811 states have call successors, (811), 211 states have call predecessors, (811), 213 states have return successors, (900), 790 states have call predecessors, (900), 807 states have call successors, (900) [2022-11-18 21:12:03,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 3520 states and 4766 transitions. [2022-11-18 21:12:03,345 INFO L78 Accepts]: Start accepts. Automaton has 3520 states and 4766 transitions. Word has length 147 [2022-11-18 21:12:03,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:12:03,346 INFO L495 AbstractCegarLoop]: Abstraction has 3520 states and 4766 transitions. [2022-11-18 21:12:03,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 11 states have internal predecessors, (145), 9 states have call successors, (29), 8 states have call predecessors, (29), 6 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2022-11-18 21:12:03,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3520 states and 4766 transitions. [2022-11-18 21:12:03,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-18 21:12:03,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:12:03,350 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-11-18 21:12:03,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-18 21:12:03,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:12:03,568 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:12:03,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:12:03,569 INFO L85 PathProgramCache]: Analyzing trace with hash -981047690, now seen corresponding path program 1 times [2022-11-18 21:12:03,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:12:03,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46452562] [2022-11-18 21:12:03,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:12:03,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:12:03,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:12:03,574 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 21:12:03,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-18 21:12:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:04,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-18 21:12:04,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:12:04,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-18 21:12:04,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-18 21:12:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-18 21:12:05,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:12:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-18 21:12:05,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:12:05,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46452562] [2022-11-18 21:12:05,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46452562] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-18 21:12:05,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 21:12:05,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-11-18 21:12:05,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750205958] [2022-11-18 21:12:05,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:12:05,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:12:05,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:12:05,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:12:05,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-18 21:12:05,671 INFO L87 Difference]: Start difference. First operand 3520 states and 4766 transitions. Second operand has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-18 21:12:07,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:12:09,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:12:11,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:12:13,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:12:16,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:12:19,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:12:21,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:12:23,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:12:25,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:12:27,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:12:29,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:12:30,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:12:30,411 INFO L93 Difference]: Finished difference Result 3671 states and 4954 transitions. [2022-11-18 21:12:30,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 21:12:30,413 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 157 [2022-11-18 21:12:30,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:12:30,430 INFO L225 Difference]: With dead ends: 3671 [2022-11-18 21:12:30,430 INFO L226 Difference]: Without dead ends: 3522 [2022-11-18 21:12:30,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 300 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-11-18 21:12:30,432 INFO L413 NwaCegarLoop]: 688 mSDtfsCounter, 6 mSDsluCounter, 2608 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3296 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2022-11-18 21:12:30,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3296 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 9 Unknown, 0 Unchecked, 24.3s Time] [2022-11-18 21:12:30,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3522 states. [2022-11-18 21:12:30,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3522 to 3522. [2022-11-18 21:12:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3522 states, 2496 states have (on average 1.2231570512820513) internal successors, (3053), 2555 states have internal predecessors, (3053), 812 states have call successors, (812), 211 states have call predecessors, (812), 213 states have return successors, (900), 790 states have call predecessors, (900), 807 states have call successors, (900) [2022-11-18 21:12:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 3522 states and 4765 transitions. [2022-11-18 21:12:30,732 INFO L78 Accepts]: Start accepts. Automaton has 3522 states and 4765 transitions. Word has length 157 [2022-11-18 21:12:30,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:12:30,732 INFO L495 AbstractCegarLoop]: Abstraction has 3522 states and 4765 transitions. [2022-11-18 21:12:30,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-18 21:12:30,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3522 states and 4765 transitions. [2022-11-18 21:12:30,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-11-18 21:12:30,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:12:30,736 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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-18 21:12:30,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-18 21:12:30,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:12:30,951 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:12:30,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:12:30,952 INFO L85 PathProgramCache]: Analyzing trace with hash 507809139, now seen corresponding path program 1 times [2022-11-18 21:12:30,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:12:30,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169039523] [2022-11-18 21:12:30,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:12:30,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:12:30,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:12:30,954 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 21:12:30,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-18 21:12:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:12:36,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-18 21:12:36,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:12:36,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 21:12:36,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 21:12:36,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 21:12:36,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 21:12:36,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 21:12:36,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 21:12:36,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-18 21:12:36,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-18 21:12:37,018 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-18 21:12:37,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:12:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-11-18 21:12:37,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:12:37,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169039523] [2022-11-18 21:12:37,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169039523] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:12:37,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 21:12:37,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2022-11-18 21:12:37,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687153131] [2022-11-18 21:12:37,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 21:12:37,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:12:37,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:12:37,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:12:37,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:12:37,268 INFO L87 Difference]: Start difference. First operand 3522 states and 4765 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2022-11-18 21:12:39,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:12:41,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:12:43,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:12:45,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:12:47,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:12:51,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:12:53,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:12:56,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:12:58,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:13:00,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:13:01,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 21:13:01,656 INFO L93 Difference]: Finished difference Result 5916 states and 8011 transitions. [2022-11-18 21:13:01,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 21:13:01,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 158 [2022-11-18 21:13:01,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 21:13:01,671 INFO L225 Difference]: With dead ends: 5916 [2022-11-18 21:13:01,671 INFO L226 Difference]: Without dead ends: 2665 [2022-11-18 21:13:01,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 306 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-18 21:13:01,682 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 5 mSDsluCounter, 3280 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3984 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2022-11-18 21:13:01,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3984 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 10 Unknown, 99 Unchecked, 24.1s Time] [2022-11-18 21:13:01,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2022-11-18 21:13:01,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2663. [2022-11-18 21:13:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2663 states, 1886 states have (on average 1.2221633085896075) internal successors, (2305), 1929 states have internal predecessors, (2305), 605 states have call successors, (605), 164 states have call predecessors, (605), 171 states have return successors, (680), 595 states have call predecessors, (680), 602 states have call successors, (680) [2022-11-18 21:13:01,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3590 transitions. [2022-11-18 21:13:01,929 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 3590 transitions. Word has length 158 [2022-11-18 21:13:01,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 21:13:01,930 INFO L495 AbstractCegarLoop]: Abstraction has 2663 states and 3590 transitions. [2022-11-18 21:13:01,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2022-11-18 21:13:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3590 transitions. [2022-11-18 21:13:01,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-18 21:13:01,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 21:13:01,934 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-11-18 21:13:01,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-18 21:13:02,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:13:02,147 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-18 21:13:02,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:13:02,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1189281783, now seen corresponding path program 1 times [2022-11-18 21:13:02,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-18 21:13:02,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639003533] [2022-11-18 21:13:02,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:13:02,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-18 21:13:02,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat [2022-11-18 21:13:02,151 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-18 21:13:02,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b3470619-0ad0-418f-877d-29a41e68a24d/bin/uautomizer-TMbwUNV5ro/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-18 21:13:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:13:03,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-18 21:13:03,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 21:13:03,861 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-18 21:13:03,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 21:13:05,678 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-11-18 21:13:05,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-18 21:13:05,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639003533] [2022-11-18 21:13:05,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639003533] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 21:13:05,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 21:13:05,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 22 [2022-11-18 21:13:05,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39674360] [2022-11-18 21:13:05,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 21:13:05,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-18 21:13:05,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-18 21:13:05,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-18 21:13:05,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2022-11-18 21:13:05,682 INFO L87 Difference]: Start difference. First operand 2663 states and 3590 transitions. Second operand has 22 states, 22 states have (on average 6.909090909090909) internal successors, (152), 22 states have internal predecessors, (152), 17 states have call successors, (31), 10 states have call predecessors, (31), 7 states have return successors, (28), 16 states have call predecessors, (28), 14 states have call successors, (28) [2022-11-18 21:13:08,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:13:10,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:13:14,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:13:17,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:13:20,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:13:23,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:13:26,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:13:28,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:13:34,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:13:37,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:13:42,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:13:44,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:13:45,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:13:46,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:13:53,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:13:54,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:13:56,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:13:58,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:13:59,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:14:00,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:14:02,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:14:06,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:14:07,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:14:09,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:14:11,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:14:17,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:14:18,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:14:20,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:14:21,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-18 21:14:23,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []