./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a --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 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a --- 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-b5237d8 [2022-11-21 16:52:15,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:52:15,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:52:15,743 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:52:15,743 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:52:15,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:52:15,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:52:15,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:52:15,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:52:15,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:52:15,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:52:15,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:52:15,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:52:15,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:52:15,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:52:15,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:52:15,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:52:15,775 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:52:15,777 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:52:15,779 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:52:15,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:52:15,782 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:52:15,783 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:52:15,784 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:52:15,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:52:15,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:52:15,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:52:15,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:52:15,790 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:52:15,791 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:52:15,791 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:52:15,792 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:52:15,793 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:52:15,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:52:15,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:52:15,795 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:52:15,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:52:15,796 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:52:15,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:52:15,797 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:52:15,798 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:52:15,799 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-21 16:52:15,839 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:52:15,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:52:15,840 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:52:15,841 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:52:15,842 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:52:15,842 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:52:15,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:52:15,843 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:52:15,843 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:52:15,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:52:15,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:52:15,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:52:15,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:52:15,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:52:15,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:52:15,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:52:15,846 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:52:15,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:52:15,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:52:15,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:52:15,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:52:15,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:52:15,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:52:15,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:52:15,848 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:52:15,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:52:15,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:52:15,848 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:52:15,849 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:52:15,849 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:52:15,849 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_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/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_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a 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 -> 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a [2022-11-21 16:52:16,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:52:16,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:52:16,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:52:16,233 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:52:16,234 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:52:16,235 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2022-11-21 16:52:19,441 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:52:19,885 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:52:19,886 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2022-11-21 16:52:19,924 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/data/9f0ab0e78/28bd0076da9f4795871d0f0ee06970d9/FLAGa85fb8fa2 [2022-11-21 16:52:19,948 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/data/9f0ab0e78/28bd0076da9f4795871d0f0ee06970d9 [2022-11-21 16:52:19,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:52:19,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:52:19,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:52:19,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:52:19,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:52:19,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:52:19" (1/1) ... [2022-11-21 16:52:19,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c48c53a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:52:19, skipping insertion in model container [2022-11-21 16:52:19,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:52:19" (1/1) ... [2022-11-21 16:52:19,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:52:20,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:52:20,974 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2022-11-21 16:52:21,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:52:21,079 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:52:21,324 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2022-11-21 16:52:21,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:52:21,376 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:52:21,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:52:21 WrapperNode [2022-11-21 16:52:21,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:52:21,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:52:21,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:52:21,379 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:52:21,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:52:21" (1/1) ... [2022-11-21 16:52:21,427 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:52:21" (1/1) ... [2022-11-21 16:52:21,521 INFO L138 Inliner]: procedures = 77, calls = 264, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 743 [2022-11-21 16:52:21,521 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:52:21,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:52:21,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:52:21,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:52:21,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:52:21" (1/1) ... [2022-11-21 16:52:21,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:52:21" (1/1) ... [2022-11-21 16:52:21,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:52:21" (1/1) ... [2022-11-21 16:52:21,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:52:21" (1/1) ... [2022-11-21 16:52:21,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:52:21" (1/1) ... [2022-11-21 16:52:21,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:52:21" (1/1) ... [2022-11-21 16:52:21,641 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:52:21" (1/1) ... [2022-11-21 16:52:21,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:52:21" (1/1) ... [2022-11-21 16:52:21,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:52:21,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:52:21,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:52:21,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:52:21,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:52:21" (1/1) ... [2022-11-21 16:52:21,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:52:21,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:52:21,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:52:21,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:52:21,775 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2022-11-21 16:52:21,775 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2022-11-21 16:52:21,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:52:21,776 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-11-21 16:52:21,776 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-11-21 16:52:21,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 16:52:21,776 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-21 16:52:21,777 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-21 16:52:21,777 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2022-11-21 16:52:21,777 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2022-11-21 16:52:21,777 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-21 16:52:21,777 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-21 16:52:21,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:52:21,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 16:52:21,778 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-11-21 16:52:21,779 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-11-21 16:52:21,779 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-21 16:52:21,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-21 16:52:21,779 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-11-21 16:52:21,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-11-21 16:52:21,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:52:21,780 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-11-21 16:52:21,780 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-11-21 16:52:21,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 16:52:21,780 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-21 16:52:21,781 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-21 16:52:21,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:52:21,781 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-21 16:52:21,781 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-21 16:52:21,781 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-11-21 16:52:21,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-11-21 16:52:21,782 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-11-21 16:52:21,782 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-11-21 16:52:21,782 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-11-21 16:52:21,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-11-21 16:52:21,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:52:21,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:52:21,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:52:21,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:52:22,092 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:52:22,095 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:52:22,330 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-11-21 16:52:22,357 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-21 16:52:23,432 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-11-21 16:52:23,433 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-11-21 16:52:23,458 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:52:23,468 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:52:23,469 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-21 16:52:23,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:52:23 BoogieIcfgContainer [2022-11-21 16:52:23,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:52:23,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:52:23,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:52:23,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:52:23,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:52:19" (1/3) ... [2022-11-21 16:52:23,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e259d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:52:23, skipping insertion in model container [2022-11-21 16:52:23,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:52:21" (2/3) ... [2022-11-21 16:52:23,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e259d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:52:23, skipping insertion in model container [2022-11-21 16:52:23,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:52:23" (3/3) ... [2022-11-21 16:52:23,484 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2022-11-21 16:52:23,509 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:52:23,509 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 16:52:23,578 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:52:23,586 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;@6d153235, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:52:23,586 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 16:52:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 120 states have (on average 1.3333333333333333) internal successors, (160), 128 states have internal predecessors, (160), 29 states have call successors, (29), 14 states have call predecessors, (29), 13 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-11-21 16:52:23,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 16:52:23,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:52:23,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:52:23,606 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:52:23,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:23,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1435834942, now seen corresponding path program 1 times [2022-11-21 16:52:23,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:23,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860849183] [2022-11-21 16:52:23,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:23,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:24,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:52:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:24,349 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-21 16:52:24,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:24,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860849183] [2022-11-21 16:52:24,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860849183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:52:24,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:52:24,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:52:24,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292038327] [2022-11-21 16:52:24,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:52:24,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:52:24,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:24,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:52:24,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:52:24,416 INFO L87 Difference]: Start difference. First operand has 164 states, 120 states have (on average 1.3333333333333333) internal successors, (160), 128 states have internal predecessors, (160), 29 states have call successors, (29), 14 states have call predecessors, (29), 13 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) 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-21 16:52:24,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:52:24,549 INFO L93 Difference]: Finished difference Result 450 states and 610 transitions. [2022-11-21 16:52:24,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:52:24,552 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-21 16:52:24,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:52:24,565 INFO L225 Difference]: With dead ends: 450 [2022-11-21 16:52:24,565 INFO L226 Difference]: Without dead ends: 289 [2022-11-21 16:52:24,570 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-21 16:52:24,574 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 186 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 412 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-21 16:52:24,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 412 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:52:24,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-11-21 16:52:24,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2022-11-21 16:52:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 212 states have (on average 1.2264150943396226) internal successors, (260), 216 states have internal predecessors, (260), 49 states have call successors, (49), 24 states have call predecessors, (49), 23 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-11-21 16:52:24,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 354 transitions. [2022-11-21 16:52:24,720 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 354 transitions. Word has length 17 [2022-11-21 16:52:24,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:52:24,721 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 354 transitions. [2022-11-21 16:52:24,722 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-21 16:52:24,722 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 354 transitions. [2022-11-21 16:52:24,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-21 16:52:24,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:52:24,724 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-21 16:52:24,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:52:24,724 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:52:24,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:24,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1561331946, now seen corresponding path program 1 times [2022-11-21 16:52:24,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:24,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512743321] [2022-11-21 16:52:24,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:24,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:24,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:52:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:24,985 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-21 16:52:24,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:24,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512743321] [2022-11-21 16:52:24,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512743321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:52:24,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:52:24,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:52:24,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12504806] [2022-11-21 16:52:24,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:52:24,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:52:24,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:24,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:52:24,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:52:24,994 INFO L87 Difference]: Start difference. First operand 285 states and 354 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-21 16:52:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:52:25,123 INFO L93 Difference]: Finished difference Result 826 states and 1033 transitions. [2022-11-21 16:52:25,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:52:25,124 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-21 16:52:25,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:52:25,131 INFO L225 Difference]: With dead ends: 826 [2022-11-21 16:52:25,131 INFO L226 Difference]: Without dead ends: 546 [2022-11-21 16:52:25,134 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-21 16:52:25,135 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 176 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:52:25,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 423 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:52:25,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-11-21 16:52:25,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 539. [2022-11-21 16:52:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 402 states have (on average 1.2189054726368158) internal successors, (490), 405 states have internal predecessors, (490), 92 states have call successors, (92), 45 states have call predecessors, (92), 44 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2022-11-21 16:52:25,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 670 transitions. [2022-11-21 16:52:25,192 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 670 transitions. Word has length 18 [2022-11-21 16:52:25,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:52:25,192 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 670 transitions. [2022-11-21 16:52:25,193 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-21 16:52:25,193 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 670 transitions. [2022-11-21 16:52:25,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-21 16:52:25,195 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:52:25,195 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, 1] [2022-11-21 16:52:25,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:52:25,195 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:52:25,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:25,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1930446545, now seen corresponding path program 1 times [2022-11-21 16:52:25,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:25,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385930250] [2022-11-21 16:52:25,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:25,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:25,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:52:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:25,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:52:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:25,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:25,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-21 16:52:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:25,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:25,628 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-21 16:52:25,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:25,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385930250] [2022-11-21 16:52:25,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385930250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:52:25,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:52:25,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:52:25,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308757798] [2022-11-21 16:52:25,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:52:25,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:52:25,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:25,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:52:25,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:52:25,635 INFO L87 Difference]: Start difference. First operand 539 states and 670 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 16:52:26,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:52:26,156 INFO L93 Difference]: Finished difference Result 1241 states and 1582 transitions. [2022-11-21 16:52:26,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:52:26,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-11-21 16:52:26,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:52:26,164 INFO L225 Difference]: With dead ends: 1241 [2022-11-21 16:52:26,164 INFO L226 Difference]: Without dead ends: 713 [2022-11-21 16:52:26,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:52:26,168 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 150 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:52:26,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 501 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:52:26,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2022-11-21 16:52:26,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 610. [2022-11-21 16:52:26,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 473 states have (on average 1.2494714587737843) internal successors, (591), 476 states have internal predecessors, (591), 92 states have call successors, (92), 45 states have call predecessors, (92), 44 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2022-11-21 16:52:26,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 771 transitions. [2022-11-21 16:52:26,233 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 771 transitions. Word has length 51 [2022-11-21 16:52:26,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:52:26,234 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 771 transitions. [2022-11-21 16:52:26,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 16:52:26,235 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 771 transitions. [2022-11-21 16:52:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-21 16:52:26,238 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:52:26,238 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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-21 16:52:26,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:52:26,239 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:52:26,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:26,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1713485533, now seen corresponding path program 1 times [2022-11-21 16:52:26,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:26,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179523171] [2022-11-21 16:52:26,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:26,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:27,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:52:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:27,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:52:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:27,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:27,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:52:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:27,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:27,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:52:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:27,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:27,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 16:52:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:27,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-21 16:52:27,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:27,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179523171] [2022-11-21 16:52:27,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179523171] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:52:27,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716523022] [2022-11-21 16:52:27,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:27,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:52:27,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:52:27,477 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:52:27,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:52:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:27,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-21 16:52:27,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:52:28,121 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-21 16:52:28,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:52:28,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716523022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:52:28,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:52:28,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-11-21 16:52:28,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733700909] [2022-11-21 16:52:28,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:52:28,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:52:28,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:28,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:52:28,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:52:28,124 INFO L87 Difference]: Start difference. First operand 610 states and 771 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 16:52:28,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:52:28,230 INFO L93 Difference]: Finished difference Result 1212 states and 1533 transitions. [2022-11-21 16:52:28,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:52:28,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2022-11-21 16:52:28,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:52:28,235 INFO L225 Difference]: With dead ends: 1212 [2022-11-21 16:52:28,235 INFO L226 Difference]: Without dead ends: 610 [2022-11-21 16:52:28,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-11-21 16:52:28,239 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 2 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:52:28,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 922 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:52:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-11-21 16:52:28,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2022-11-21 16:52:28,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 473 states have (on average 1.2473572938689217) internal successors, (590), 476 states have internal predecessors, (590), 92 states have call successors, (92), 45 states have call predecessors, (92), 44 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2022-11-21 16:52:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 770 transitions. [2022-11-21 16:52:28,293 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 770 transitions. Word has length 86 [2022-11-21 16:52:28,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:52:28,294 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 770 transitions. [2022-11-21 16:52:28,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 16:52:28,294 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 770 transitions. [2022-11-21 16:52:28,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-21 16:52:28,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:52:28,297 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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-21 16:52:28,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-21 16:52:28,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:52:28,506 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:52:28,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:28,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1473245787, now seen corresponding path program 1 times [2022-11-21 16:52:28,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:28,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509825601] [2022-11-21 16:52:28,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:28,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:29,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:52:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:29,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:52:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:29,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:29,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:52:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:29,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:29,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:52:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:29,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:29,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 16:52:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:29,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:29,701 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-21 16:52:29,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:29,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509825601] [2022-11-21 16:52:29,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509825601] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:52:29,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346445884] [2022-11-21 16:52:29,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:29,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:52:29,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:52:29,704 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:52:29,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:52:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:30,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-21 16:52:30,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:52:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-21 16:52:30,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:52:30,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346445884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:52:30,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:52:30,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2022-11-21 16:52:30,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142964760] [2022-11-21 16:52:30,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:52:30,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:52:30,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:30,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:52:30,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:52:30,345 INFO L87 Difference]: Start difference. First operand 610 states and 770 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:52:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:52:30,444 INFO L93 Difference]: Finished difference Result 1195 states and 1536 transitions. [2022-11-21 16:52:30,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:52:30,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2022-11-21 16:52:30,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:52:30,452 INFO L225 Difference]: With dead ends: 1195 [2022-11-21 16:52:30,453 INFO L226 Difference]: Without dead ends: 598 [2022-11-21 16:52:30,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-21 16:52:30,458 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 42 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:52:30,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 683 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:52:30,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-11-21 16:52:30,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 428. [2022-11-21 16:52:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 333 states have (on average 1.2372372372372373) internal successors, (412), 336 states have internal predecessors, (412), 62 states have call successors, (62), 33 states have call predecessors, (62), 32 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2022-11-21 16:52:30,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 532 transitions. [2022-11-21 16:52:30,511 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 532 transitions. Word has length 86 [2022-11-21 16:52:30,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:52:30,512 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 532 transitions. [2022-11-21 16:52:30,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:52:30,513 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 532 transitions. [2022-11-21 16:52:30,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-21 16:52:30,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:52:30,515 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:52:30,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:52:30,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:52:30,735 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:52:30,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:30,735 INFO L85 PathProgramCache]: Analyzing trace with hash -656088645, now seen corresponding path program 1 times [2022-11-21 16:52:30,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:30,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908638155] [2022-11-21 16:52:30,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:30,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:31,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:52:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:31,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:52:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:31,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:31,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:52:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:31,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:31,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:52:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:31,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:31,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-21 16:52:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:31,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 16:52:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:31,748 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 16:52:31,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:31,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908638155] [2022-11-21 16:52:31,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908638155] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:52:31,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902014168] [2022-11-21 16:52:31,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:31,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:52:31,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:52:31,751 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:52:31,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:52:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:32,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-21 16:52:32,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:52:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-21 16:52:32,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:52:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 16:52:32,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902014168] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:52:32,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:52:32,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 11 [2022-11-21 16:52:32,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728598803] [2022-11-21 16:52:32,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:52:32,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 16:52:32,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:32,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 16:52:32,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-21 16:52:32,783 INFO L87 Difference]: Start difference. First operand 428 states and 532 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 7 states have internal predecessors, (72), 4 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-11-21 16:52:33,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:52:33,738 INFO L93 Difference]: Finished difference Result 1043 states and 1336 transitions. [2022-11-21 16:52:33,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:52:33,739 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 7 states have internal predecessors, (72), 4 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 83 [2022-11-21 16:52:33,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:52:33,745 INFO L225 Difference]: With dead ends: 1043 [2022-11-21 16:52:33,746 INFO L226 Difference]: Without dead ends: 628 [2022-11-21 16:52:33,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 179 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:52:33,750 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 137 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:52:33,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1362 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 16:52:33,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2022-11-21 16:52:33,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 464. [2022-11-21 16:52:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 360 states have (on average 1.2194444444444446) internal successors, (439), 363 states have internal predecessors, (439), 65 states have call successors, (65), 33 states have call predecessors, (65), 38 states have return successors, (79), 67 states have call predecessors, (79), 61 states have call successors, (79) [2022-11-21 16:52:33,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 583 transitions. [2022-11-21 16:52:33,823 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 583 transitions. Word has length 83 [2022-11-21 16:52:33,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:52:33,827 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 583 transitions. [2022-11-21 16:52:33,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 7 states have internal predecessors, (72), 4 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-11-21 16:52:33,827 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 583 transitions. [2022-11-21 16:52:33,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-21 16:52:33,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:52:33,832 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:52:33,843 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:52:34,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:52:34,041 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:52:34,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:34,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1559086053, now seen corresponding path program 1 times [2022-11-21 16:52:34,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:34,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844377135] [2022-11-21 16:52:34,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:34,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:34,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:52:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:34,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:52:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:34,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:34,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:52:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:34,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:34,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:52:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:34,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:34,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-21 16:52:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:34,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 16:52:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:34,776 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-21 16:52:34,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:34,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844377135] [2022-11-21 16:52:34,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844377135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:52:34,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:52:34,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:52:34,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112566748] [2022-11-21 16:52:34,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:52:34,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:52:34,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:34,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:52:34,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:52:34,780 INFO L87 Difference]: Start difference. First operand 464 states and 583 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-21 16:52:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:52:35,421 INFO L93 Difference]: Finished difference Result 1009 states and 1315 transitions. [2022-11-21 16:52:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 16:52:35,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2022-11-21 16:52:35,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:52:35,426 INFO L225 Difference]: With dead ends: 1009 [2022-11-21 16:52:35,427 INFO L226 Difference]: Without dead ends: 673 [2022-11-21 16:52:35,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:52:35,429 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 94 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 16:52:35,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1363 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 16:52:35,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-11-21 16:52:35,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 479. [2022-11-21 16:52:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 372 states have (on average 1.2123655913978495) internal successors, (451), 372 states have internal predecessors, (451), 65 states have call successors, (65), 33 states have call predecessors, (65), 41 states have return successors, (84), 73 states have call predecessors, (84), 61 states have call successors, (84) [2022-11-21 16:52:35,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 600 transitions. [2022-11-21 16:52:35,488 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 600 transitions. Word has length 83 [2022-11-21 16:52:35,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:52:35,488 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 600 transitions. [2022-11-21 16:52:35,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-21 16:52:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 600 transitions. [2022-11-21 16:52:35,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-21 16:52:35,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:52:35,497 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:52:35,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:52:35,500 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:52:35,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:35,504 INFO L85 PathProgramCache]: Analyzing trace with hash -364422629, now seen corresponding path program 2 times [2022-11-21 16:52:35,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:35,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855455969] [2022-11-21 16:52:35,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:35,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:36,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:52:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:36,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:52:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:36,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:36,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:52:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:36,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:36,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:52:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:36,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:36,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-21 16:52:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:36,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 16:52:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 16:52:36,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:36,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855455969] [2022-11-21 16:52:36,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855455969] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:52:36,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814063256] [2022-11-21 16:52:36,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:52:36,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:52:36,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:52:36,408 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:52:36,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:52:36,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-21 16:52:36,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:52:36,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-21 16:52:36,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:52:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-21 16:52:37,076 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:52:37,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814063256] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:52:37,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:52:37,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2022-11-21 16:52:37,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31183163] [2022-11-21 16:52:37,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:52:37,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:52:37,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:37,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:52:37,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-11-21 16:52:37,080 INFO L87 Difference]: Start difference. First operand 479 states and 600 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:52:37,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:52:37,317 INFO L93 Difference]: Finished difference Result 1072 states and 1375 transitions. [2022-11-21 16:52:37,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:52:37,318 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2022-11-21 16:52:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:52:37,322 INFO L225 Difference]: With dead ends: 1072 [2022-11-21 16:52:37,322 INFO L226 Difference]: Without dead ends: 606 [2022-11-21 16:52:37,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-11-21 16:52:37,326 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 151 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 16:52:37,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1754 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 16:52:37,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-11-21 16:52:37,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 477. [2022-11-21 16:52:37,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 370 states have (on average 1.2) internal successors, (444), 371 states have internal predecessors, (444), 65 states have call successors, (65), 33 states have call predecessors, (65), 41 states have return successors, (84), 72 states have call predecessors, (84), 61 states have call successors, (84) [2022-11-21 16:52:37,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 593 transitions. [2022-11-21 16:52:37,378 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 593 transitions. Word has length 83 [2022-11-21 16:52:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:52:37,378 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 593 transitions. [2022-11-21 16:52:37,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:52:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 593 transitions. [2022-11-21 16:52:37,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-21 16:52:37,380 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:52:37,380 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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-21 16:52:37,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:52:37,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:52:37,589 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:52:37,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:37,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1107763325, now seen corresponding path program 1 times [2022-11-21 16:52:37,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:37,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683710141] [2022-11-21 16:52:37,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:37,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:38,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:52:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:38,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:52:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:38,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:38,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:52:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:38,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:38,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:52:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:38,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:38,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 16:52:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:38,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-21 16:52:38,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:38,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683710141] [2022-11-21 16:52:38,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683710141] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:52:38,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075288585] [2022-11-21 16:52:38,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:38,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:52:38,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:52:38,404 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:52:38,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 16:52:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:38,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:52:38,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:52:39,119 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-21 16:52:39,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:52:39,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075288585] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:52:39,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:52:39,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2022-11-21 16:52:39,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691084221] [2022-11-21 16:52:39,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:52:39,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:52:39,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:39,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:52:39,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-11-21 16:52:39,123 INFO L87 Difference]: Start difference. First operand 477 states and 593 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:52:39,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:52:39,373 INFO L93 Difference]: Finished difference Result 746 states and 926 transitions. [2022-11-21 16:52:39,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:52:39,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2022-11-21 16:52:39,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:52:39,378 INFO L225 Difference]: With dead ends: 746 [2022-11-21 16:52:39,378 INFO L226 Difference]: Without dead ends: 743 [2022-11-21 16:52:39,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-11-21 16:52:39,382 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 281 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 16:52:39,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 383 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 16:52:39,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-11-21 16:52:39,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 717. [2022-11-21 16:52:39,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 558 states have (on average 1.2060931899641576) internal successors, (673), 557 states have internal predecessors, (673), 93 states have call successors, (93), 51 states have call predecessors, (93), 65 states have return successors, (130), 108 states have call predecessors, (130), 89 states have call successors, (130) [2022-11-21 16:52:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 896 transitions. [2022-11-21 16:52:39,467 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 896 transitions. Word has length 86 [2022-11-21 16:52:39,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:52:39,469 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 896 transitions. [2022-11-21 16:52:39,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 16:52:39,469 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 896 transitions. [2022-11-21 16:52:39,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-21 16:52:39,471 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:52:39,472 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-11-21 16:52:39,486 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 16:52:39,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:52:39,681 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:52:39,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:39,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2015789822, now seen corresponding path program 1 times [2022-11-21 16:52:39,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:39,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262428864] [2022-11-21 16:52:39,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:39,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:39,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:52:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:39,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:52:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:39,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:39,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:52:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:39,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:39,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:52:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:39,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-21 16:52:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:39,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:39,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-21 16:52:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:39,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:39,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-21 16:52:39,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:39,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262428864] [2022-11-21 16:52:39,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262428864] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:52:39,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:52:39,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:52:39,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999430121] [2022-11-21 16:52:39,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:52:39,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:52:39,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:39,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:52:39,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:52:39,999 INFO L87 Difference]: Start difference. First operand 717 states and 896 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-21 16:52:40,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:52:40,456 INFO L93 Difference]: Finished difference Result 1432 states and 1788 transitions. [2022-11-21 16:52:40,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:52:40,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 96 [2022-11-21 16:52:40,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:52:40,461 INFO L225 Difference]: With dead ends: 1432 [2022-11-21 16:52:40,462 INFO L226 Difference]: Without dead ends: 706 [2022-11-21 16:52:40,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:52:40,465 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 116 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:52:40,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 668 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:52:40,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2022-11-21 16:52:40,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 667. [2022-11-21 16:52:40,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 518 states have (on average 1.196911196911197) internal successors, (620), 519 states have internal predecessors, (620), 90 states have call successors, (90), 45 states have call predecessors, (90), 58 states have return successors, (124), 102 states have call predecessors, (124), 86 states have call successors, (124) [2022-11-21 16:52:40,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 834 transitions. [2022-11-21 16:52:40,548 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 834 transitions. Word has length 96 [2022-11-21 16:52:40,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:52:40,549 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 834 transitions. [2022-11-21 16:52:40,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-21 16:52:40,549 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 834 transitions. [2022-11-21 16:52:40,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-21 16:52:40,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:52:40,552 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:52:40,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:52:40,553 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:52:40,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:40,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1914487614, now seen corresponding path program 1 times [2022-11-21 16:52:40,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:40,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835905637] [2022-11-21 16:52:40,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:40,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:40,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:52:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:41,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:52:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:41,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:41,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:52:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:41,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:41,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:52:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:41,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:41,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 16:52:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:41,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:41,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-21 16:52:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:41,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:52:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:41,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:52:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:41,205 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-21 16:52:41,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:41,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835905637] [2022-11-21 16:52:41,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835905637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:52:41,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:52:41,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:52:41,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241073082] [2022-11-21 16:52:41,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:52:41,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:52:41,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:41,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:52:41,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:52:41,209 INFO L87 Difference]: Start difference. First operand 667 states and 834 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-21 16:52:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:52:42,164 INFO L93 Difference]: Finished difference Result 1187 states and 1524 transitions. [2022-11-21 16:52:42,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:52:42,165 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 105 [2022-11-21 16:52:42,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:52:42,171 INFO L225 Difference]: With dead ends: 1187 [2022-11-21 16:52:42,172 INFO L226 Difference]: Without dead ends: 875 [2022-11-21 16:52:42,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:52:42,174 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 183 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 16:52:42,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1188 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 16:52:42,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2022-11-21 16:52:42,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 675. [2022-11-21 16:52:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 524 states have (on average 1.1946564885496183) internal successors, (626), 525 states have internal predecessors, (626), 90 states have call successors, (90), 45 states have call predecessors, (90), 60 states have return successors, (126), 104 states have call predecessors, (126), 86 states have call successors, (126) [2022-11-21 16:52:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 842 transitions. [2022-11-21 16:52:42,265 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 842 transitions. Word has length 105 [2022-11-21 16:52:42,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:52:42,265 INFO L495 AbstractCegarLoop]: Abstraction has 675 states and 842 transitions. [2022-11-21 16:52:42,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-21 16:52:42,266 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 842 transitions. [2022-11-21 16:52:42,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-21 16:52:42,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:52:42,268 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-11-21 16:52:42,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 16:52:42,268 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:52:42,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:42,269 INFO L85 PathProgramCache]: Analyzing trace with hash -747675683, now seen corresponding path program 1 times [2022-11-21 16:52:42,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:42,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261958104] [2022-11-21 16:52:42,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:42,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:42,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:52:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:42,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:52:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:42,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:42,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:52:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:42,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:42,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:52:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:42,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:43,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 16:52:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:43,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:43,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-21 16:52:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:43,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:52:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:43,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:52:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-21 16:52:43,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:43,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261958104] [2022-11-21 16:52:43,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261958104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:52:43,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:52:43,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-21 16:52:43,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590649218] [2022-11-21 16:52:43,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:52:43,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 16:52:43,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:43,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 16:52:43,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:52:43,116 INFO L87 Difference]: Start difference. First operand 675 states and 842 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-21 16:52:44,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:52:44,242 INFO L93 Difference]: Finished difference Result 913 states and 1165 transitions. [2022-11-21 16:52:44,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 16:52:44,243 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 105 [2022-11-21 16:52:44,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:52:44,247 INFO L225 Difference]: With dead ends: 913 [2022-11-21 16:52:44,248 INFO L226 Difference]: Without dead ends: 871 [2022-11-21 16:52:44,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-11-21 16:52:44,249 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 297 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 16:52:44,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1676 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 16:52:44,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-11-21 16:52:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 677. [2022-11-21 16:52:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 526 states have (on average 1.193916349809886) internal successors, (628), 527 states have internal predecessors, (628), 90 states have call successors, (90), 45 states have call predecessors, (90), 60 states have return successors, (126), 104 states have call predecessors, (126), 86 states have call successors, (126) [2022-11-21 16:52:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 844 transitions. [2022-11-21 16:52:44,342 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 844 transitions. Word has length 105 [2022-11-21 16:52:44,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:52:44,342 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 844 transitions. [2022-11-21 16:52:44,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-21 16:52:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 844 transitions. [2022-11-21 16:52:44,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-21 16:52:44,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:52:44,344 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:52:44,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 16:52:44,345 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:52:44,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:44,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1055307428, now seen corresponding path program 1 times [2022-11-21 16:52:44,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:44,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432506391] [2022-11-21 16:52:44,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:44,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:44,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:52:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:44,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:52:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:44,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:44,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:52:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:44,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:44,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:52:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:44,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:44,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 16:52:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:44,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:44,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-21 16:52:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:44,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-21 16:52:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:44,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-21 16:52:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-21 16:52:44,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:44,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432506391] [2022-11-21 16:52:44,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432506391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:52:44,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:52:44,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:52:44,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922865346] [2022-11-21 16:52:44,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:52:44,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:52:44,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:44,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:52:44,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:52:44,775 INFO L87 Difference]: Start difference. First operand 677 states and 844 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-21 16:52:45,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:52:45,285 INFO L93 Difference]: Finished difference Result 1271 states and 1594 transitions. [2022-11-21 16:52:45,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 16:52:45,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 106 [2022-11-21 16:52:45,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:52:45,290 INFO L225 Difference]: With dead ends: 1271 [2022-11-21 16:52:45,291 INFO L226 Difference]: Without dead ends: 647 [2022-11-21 16:52:45,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:52:45,294 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 107 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:52:45,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 489 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:52:45,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-11-21 16:52:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 635. [2022-11-21 16:52:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 492 states have (on average 1.1869918699186992) internal successors, (584), 495 states have internal predecessors, (584), 86 states have call successors, (86), 45 states have call predecessors, (86), 56 states have return successors, (114), 94 states have call predecessors, (114), 82 states have call successors, (114) [2022-11-21 16:52:45,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 784 transitions. [2022-11-21 16:52:45,378 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 784 transitions. Word has length 106 [2022-11-21 16:52:45,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:52:45,379 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 784 transitions. [2022-11-21 16:52:45,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-21 16:52:45,379 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 784 transitions. [2022-11-21 16:52:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-21 16:52:45,382 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:52:45,382 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 16:52:45,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 16:52:45,383 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:52:45,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:45,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1982538561, now seen corresponding path program 1 times [2022-11-21 16:52:45,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:45,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231906563] [2022-11-21 16:52:45,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:45,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:45,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:52:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:45,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:52:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:45,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:45,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:52:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:45,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:45,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:52:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:45,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:45,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 16:52:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:45,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:45,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-21 16:52:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:45,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-21 16:52:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:46,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-21 16:52:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:46,006 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-21 16:52:46,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:46,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231906563] [2022-11-21 16:52:46,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231906563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:52:46,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:52:46,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:52:46,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724157070] [2022-11-21 16:52:46,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:52:46,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:52:46,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:46,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:52:46,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:52:46,010 INFO L87 Difference]: Start difference. First operand 635 states and 784 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-21 16:52:47,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:52:47,223 INFO L93 Difference]: Finished difference Result 1855 states and 2292 transitions. [2022-11-21 16:52:47,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 16:52:47,224 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 108 [2022-11-21 16:52:47,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:52:47,231 INFO L225 Difference]: With dead ends: 1855 [2022-11-21 16:52:47,231 INFO L226 Difference]: Without dead ends: 1242 [2022-11-21 16:52:47,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:52:47,255 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 689 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 16:52:47,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 681 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-21 16:52:47,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2022-11-21 16:52:47,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1146. [2022-11-21 16:52:47,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 888 states have (on average 1.1925675675675675) internal successors, (1059), 894 states have internal predecessors, (1059), 155 states have call successors, (155), 81 states have call predecessors, (155), 102 states have return successors, (208), 170 states have call predecessors, (208), 150 states have call successors, (208) [2022-11-21 16:52:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1422 transitions. [2022-11-21 16:52:47,425 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1422 transitions. Word has length 108 [2022-11-21 16:52:47,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:52:47,425 INFO L495 AbstractCegarLoop]: Abstraction has 1146 states and 1422 transitions. [2022-11-21 16:52:47,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-21 16:52:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1422 transitions. [2022-11-21 16:52:47,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-21 16:52:47,428 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:52:47,428 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-11-21 16:52:47,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 16:52:47,429 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:52:47,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:47,429 INFO L85 PathProgramCache]: Analyzing trace with hash -858991793, now seen corresponding path program 1 times [2022-11-21 16:52:47,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:47,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215786650] [2022-11-21 16:52:47,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:47,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:48,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:52:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:48,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:52:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:48,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:48,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:52:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:48,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:48,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:52:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:48,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:48,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 16:52:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:48,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:48,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:52:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:48,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-21 16:52:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:48,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:52:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:48,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 16:52:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:48,503 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-21 16:52:48,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:48,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215786650] [2022-11-21 16:52:48,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215786650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:52:48,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:52:48,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:52:48,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940589553] [2022-11-21 16:52:48,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:52:48,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:52:48,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:48,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:52:48,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:52:48,506 INFO L87 Difference]: Start difference. First operand 1146 states and 1422 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-21 16:52:48,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:52:48,883 INFO L93 Difference]: Finished difference Result 1780 states and 2207 transitions. [2022-11-21 16:52:48,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:52:48,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 117 [2022-11-21 16:52:48,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:52:48,888 INFO L225 Difference]: With dead ends: 1780 [2022-11-21 16:52:48,888 INFO L226 Difference]: Without dead ends: 678 [2022-11-21 16:52:48,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:52:48,892 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 64 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 16:52:48,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 561 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 16:52:48,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-11-21 16:52:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 643. [2022-11-21 16:52:48,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 498 states have (on average 1.1827309236947792) internal successors, (589), 501 states have internal predecessors, (589), 87 states have call successors, (87), 46 states have call predecessors, (87), 57 states have return successors, (114), 95 states have call predecessors, (114), 82 states have call successors, (114) [2022-11-21 16:52:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 790 transitions. [2022-11-21 16:52:48,976 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 790 transitions. Word has length 117 [2022-11-21 16:52:48,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:52:48,977 INFO L495 AbstractCegarLoop]: Abstraction has 643 states and 790 transitions. [2022-11-21 16:52:48,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-21 16:52:48,977 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 790 transitions. [2022-11-21 16:52:48,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-21 16:52:48,978 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:52:48,979 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2022-11-21 16:52:48,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 16:52:48,979 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:52:48,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:48,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1996925200, now seen corresponding path program 1 times [2022-11-21 16:52:48,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:48,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656058115] [2022-11-21 16:52:48,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:48,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:49,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:52:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:49,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:52:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:49,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:49,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:52:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:49,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:49,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:52:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:49,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:49,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 16:52:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:49,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:49,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:52:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:49,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-21 16:52:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:49,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:52:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:49,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 16:52:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:49,587 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-21 16:52:49,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:49,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656058115] [2022-11-21 16:52:49,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656058115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:52:49,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:52:49,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:52:49,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466536570] [2022-11-21 16:52:49,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:52:49,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:52:49,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:49,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:52:49,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:52:49,590 INFO L87 Difference]: Start difference. First operand 643 states and 790 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 5 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-21 16:52:50,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:52:50,209 INFO L93 Difference]: Finished difference Result 1241 states and 1534 transitions. [2022-11-21 16:52:50,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:52:50,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 5 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 117 [2022-11-21 16:52:50,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:52:50,216 INFO L225 Difference]: With dead ends: 1241 [2022-11-21 16:52:50,216 INFO L226 Difference]: Without dead ends: 1236 [2022-11-21 16:52:50,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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-21 16:52:50,218 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 268 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:52:50,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 563 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:52:50,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2022-11-21 16:52:50,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1175. [2022-11-21 16:52:50,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 911 states have (on average 1.1909989023051593) internal successors, (1085), 916 states have internal predecessors, (1085), 159 states have call successors, (159), 82 states have call predecessors, (159), 104 states have return successors, (222), 176 states have call predecessors, (222), 154 states have call successors, (222) [2022-11-21 16:52:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1466 transitions. [2022-11-21 16:52:50,388 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1466 transitions. Word has length 117 [2022-11-21 16:52:50,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:52:50,389 INFO L495 AbstractCegarLoop]: Abstraction has 1175 states and 1466 transitions. [2022-11-21 16:52:50,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 5 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-21 16:52:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1466 transitions. [2022-11-21 16:52:50,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-21 16:52:50,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:52:50,392 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-11-21 16:52:50,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 16:52:50,393 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:52:50,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash 365160195, now seen corresponding path program 1 times [2022-11-21 16:52:50,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:50,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837704625] [2022-11-21 16:52:50,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:50,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:51,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:52:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:51,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:52:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:51,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:51,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:52:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:51,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:51,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:52:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:51,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:51,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 16:52:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:51,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:51,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:52:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:51,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-21 16:52:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:51,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:52:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:51,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 16:52:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:51,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-21 16:52:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:51,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:51,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-21 16:52:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:51,428 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-21 16:52:51,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:51,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837704625] [2022-11-21 16:52:51,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837704625] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:52:51,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014479386] [2022-11-21 16:52:51,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:51,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:52:51,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:52:51,431 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:52:51,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 16:52:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:52,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 1885 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 16:52:52,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:52:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-21 16:52:52,363 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:52:52,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014479386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:52:52,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:52:52,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2022-11-21 16:52:52,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529009819] [2022-11-21 16:52:52,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:52:52,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:52:52,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:52,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:52:52,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-11-21 16:52:52,367 INFO L87 Difference]: Start difference. First operand 1175 states and 1466 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-21 16:52:52,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:52:52,626 INFO L93 Difference]: Finished difference Result 1246 states and 1548 transitions. [2022-11-21 16:52:52,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:52:52,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2022-11-21 16:52:52,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:52:52,632 INFO L225 Difference]: With dead ends: 1246 [2022-11-21 16:52:52,633 INFO L226 Difference]: Without dead ends: 1227 [2022-11-21 16:52:52,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-11-21 16:52:52,634 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 217 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:52:52,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 444 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:52:52,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2022-11-21 16:52:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1175. [2022-11-21 16:52:52,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 911 states have (on average 1.1866081229418222) internal successors, (1081), 916 states have internal predecessors, (1081), 159 states have call successors, (159), 82 states have call predecessors, (159), 104 states have return successors, (222), 176 states have call predecessors, (222), 154 states have call successors, (222) [2022-11-21 16:52:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1462 transitions. [2022-11-21 16:52:52,820 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1462 transitions. Word has length 130 [2022-11-21 16:52:52,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:52:52,821 INFO L495 AbstractCegarLoop]: Abstraction has 1175 states and 1462 transitions. [2022-11-21 16:52:52,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-21 16:52:52,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1462 transitions. [2022-11-21 16:52:52,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-21 16:52:52,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:52:52,823 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:52:52,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 16:52:53,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-21 16:52:53,034 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:52:53,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:53,034 INFO L85 PathProgramCache]: Analyzing trace with hash -556379909, now seen corresponding path program 1 times [2022-11-21 16:52:53,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:53,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75626910] [2022-11-21 16:52:53,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:53,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:53,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:52:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:53,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:52:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:53,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:53,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:52:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:53,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:53,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:52:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:53,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:53,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 16:52:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:53,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:53,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:52:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:53,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-21 16:52:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:53,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:52:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:53,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 16:52:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:53,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-21 16:52:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:53,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:53,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-21 16:52:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-21 16:52:53,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:53,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75626910] [2022-11-21 16:52:53,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75626910] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:52:53,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790604213] [2022-11-21 16:52:53,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:53,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:52:53,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:52:53,532 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:52:53,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 16:52:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:54,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 1906 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:52:54,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:52:54,656 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-21 16:52:54,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:52:54,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790604213] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:52:54,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:52:54,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-21 16:52:54,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304296669] [2022-11-21 16:52:54,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:52:54,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 16:52:54,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:54,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 16:52:54,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:52:54,660 INFO L87 Difference]: Start difference. First operand 1175 states and 1462 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-21 16:52:54,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:52:54,847 INFO L93 Difference]: Finished difference Result 1665 states and 2070 transitions. [2022-11-21 16:52:54,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 16:52:54,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 134 [2022-11-21 16:52:54,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:52:54,853 INFO L225 Difference]: With dead ends: 1665 [2022-11-21 16:52:54,853 INFO L226 Difference]: Without dead ends: 523 [2022-11-21 16:52:54,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:52:54,858 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 45 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:52:54,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 417 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:52:54,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-11-21 16:52:54,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2022-11-21 16:52:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 398 states have (on average 1.1231155778894473) internal successors, (447), 401 states have internal predecessors, (447), 73 states have call successors, (73), 41 states have call predecessors, (73), 51 states have return successors, (94), 80 states have call predecessors, (94), 69 states have call successors, (94) [2022-11-21 16:52:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 614 transitions. [2022-11-21 16:52:54,964 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 614 transitions. Word has length 134 [2022-11-21 16:52:54,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:52:54,967 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 614 transitions. [2022-11-21 16:52:54,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-21 16:52:54,968 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 614 transitions. [2022-11-21 16:52:54,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-21 16:52:54,970 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:52:54,971 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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, 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-21 16:52:54,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 16:52:55,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-21 16:52:55,183 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:52:55,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:55,183 INFO L85 PathProgramCache]: Analyzing trace with hash -407074935, now seen corresponding path program 1 times [2022-11-21 16:52:55,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:55,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134798646] [2022-11-21 16:52:55,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:55,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:55,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:52:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:55,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:52:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:55,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:55,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:52:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:55,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:55,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:52:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:55,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:55,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 16:52:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:55,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:55,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:52:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:55,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-21 16:52:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:55,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:52:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:55,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 16:52:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:55,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-21 16:52:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:55,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-21 16:52:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:55,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-21 16:52:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:55,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-21 16:52:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-21 16:52:55,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:55,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134798646] [2022-11-21 16:52:55,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134798646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:52:55,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:52:55,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 16:52:55,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451643550] [2022-11-21 16:52:55,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:52:55,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 16:52:55,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:55,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 16:52:55,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 16:52:55,879 INFO L87 Difference]: Start difference. First operand 523 states and 614 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-21 16:52:56,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:52:56,439 INFO L93 Difference]: Finished difference Result 844 states and 998 transitions. [2022-11-21 16:52:56,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:52:56,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 147 [2022-11-21 16:52:56,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:52:56,442 INFO L225 Difference]: With dead ends: 844 [2022-11-21 16:52:56,442 INFO L226 Difference]: Without dead ends: 390 [2022-11-21 16:52:56,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-21 16:52:56,445 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 205 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 16:52:56,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 476 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 16:52:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-21 16:52:56,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 379. [2022-11-21 16:52:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 289 states have (on average 1.1176470588235294) internal successors, (323), 292 states have internal predecessors, (323), 54 states have call successors, (54), 31 states have call predecessors, (54), 35 states have return successors, (62), 55 states have call predecessors, (62), 50 states have call successors, (62) [2022-11-21 16:52:56,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 439 transitions. [2022-11-21 16:52:56,503 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 439 transitions. Word has length 147 [2022-11-21 16:52:56,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:52:56,504 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 439 transitions. [2022-11-21 16:52:56,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-21 16:52:56,504 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 439 transitions. [2022-11-21 16:52:56,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-11-21 16:52:56,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:52:56,506 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 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-21 16:52:56,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 16:52:56,507 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:52:56,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:56,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1779093938, now seen corresponding path program 1 times [2022-11-21 16:52:56,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:56,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834655332] [2022-11-21 16:52:56,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:56,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:57,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:52:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:57,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:52:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:57,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:57,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:52:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:57,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:57,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:52:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:57,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:57,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 16:52:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:57,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:57,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:52:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:57,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-21 16:52:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:57,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:52:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:57,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 16:52:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:57,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-21 16:52:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:57,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-21 16:52:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:57,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-21 16:52:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:57,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-21 16:52:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-21 16:52:57,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:57,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834655332] [2022-11-21 16:52:57,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834655332] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:52:57,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:52:57,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 16:52:57,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418651354] [2022-11-21 16:52:57,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:52:57,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:52:57,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:52:57,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:52:57,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:52:57,648 INFO L87 Difference]: Start difference. First operand 379 states and 439 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 7 states have internal predecessors, (94), 5 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-21 16:52:58,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:52:58,436 INFO L93 Difference]: Finished difference Result 399 states and 457 transitions. [2022-11-21 16:52:58,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:52:58,437 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 7 states have internal predecessors, (94), 5 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 149 [2022-11-21 16:52:58,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:52:58,439 INFO L225 Difference]: With dead ends: 399 [2022-11-21 16:52:58,439 INFO L226 Difference]: Without dead ends: 345 [2022-11-21 16:52:58,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-21 16:52:58,441 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 438 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 16:52:58,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 674 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 16:52:58,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-11-21 16:52:58,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 246. [2022-11-21 16:52:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 187 states have (on average 1.0962566844919786) internal successors, (205), 190 states have internal predecessors, (205), 34 states have call successors, (34), 22 states have call predecessors, (34), 24 states have return successors, (37), 33 states have call predecessors, (37), 32 states have call successors, (37) [2022-11-21 16:52:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 276 transitions. [2022-11-21 16:52:58,484 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 276 transitions. Word has length 149 [2022-11-21 16:52:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:52:58,485 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 276 transitions. [2022-11-21 16:52:58,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 7 states have internal predecessors, (94), 5 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-21 16:52:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 276 transitions. [2022-11-21 16:52:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-21 16:52:58,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 16:52:58,488 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 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] [2022-11-21 16:52:58,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 16:52:58,489 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 16:52:58,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:52:58,489 INFO L85 PathProgramCache]: Analyzing trace with hash -148329902, now seen corresponding path program 1 times [2022-11-21 16:52:58,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:52:58,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291648084] [2022-11-21 16:52:58,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:58,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:52:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:59,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 16:52:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:59,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-21 16:52:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:59,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:59,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 16:52:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:59,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:59,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-21 16:52:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:59,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:59,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 16:52:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:59,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 16:52:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:59,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 16:52:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:59,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-21 16:52:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:59,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 16:52:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:59,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 16:52:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:59,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-21 16:52:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:59,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-21 16:52:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:59,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-21 16:52:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:59,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 16:52:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:59,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:59,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-21 16:52:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:59,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 16:52:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:52:59,783 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-21 16:52:59,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:52:59,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291648084] [2022-11-21 16:52:59,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291648084] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:52:59,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528958756] [2022-11-21 16:52:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:52:59,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:52:59,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:52:59,786 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:52:59,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 16:53:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:53:00,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 2081 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-21 16:53:00,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:53:01,085 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-21 16:53:01,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:53:01,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528958756] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:53:01,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:53:01,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2022-11-21 16:53:01,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691028499] [2022-11-21 16:53:01,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:53:01,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 16:53:01,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:53:01,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:53:01,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2022-11-21 16:53:01,088 INFO L87 Difference]: Start difference. First operand 246 states and 276 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-21 16:53:01,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:53:01,227 INFO L93 Difference]: Finished difference Result 252 states and 281 transitions. [2022-11-21 16:53:01,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:53:01,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 178 [2022-11-21 16:53:01,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 16:53:01,229 INFO L225 Difference]: With dead ends: 252 [2022-11-21 16:53:01,229 INFO L226 Difference]: Without dead ends: 0 [2022-11-21 16:53:01,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-11-21 16:53:01,231 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 38 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 16:53:01,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 578 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 16:53:01,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-21 16:53:01,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-21 16:53:01,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:53:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-21 16:53:01,233 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2022-11-21 16:53:01,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 16:53:01,233 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 16:53:01,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-21 16:53:01,234 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-21 16:53:01,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-21 16:53:01,237 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-21 16:53:01,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 16:53:01,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:53:01,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-21 16:53:12,010 INFO L902 garLoopResultBuilder]: At program point L4257(lines 4256 4258) the Hoare annotation is: true [2022-11-21 16:53:12,010 INFO L899 garLoopResultBuilder]: For program point kbtab_initEXIT(lines 3909 3925) no Hoare annotation was computed. [2022-11-21 16:53:12,011 INFO L902 garLoopResultBuilder]: At program point L3922(lines 3911 3924) the Hoare annotation is: true [2022-11-21 16:53:12,011 INFO L902 garLoopResultBuilder]: At program point kbtab_initENTRY(lines 3909 3925) the Hoare annotation is: true [2022-11-21 16:53:12,011 INFO L902 garLoopResultBuilder]: At program point L3471(lines 3465 3473) the Hoare annotation is: true [2022-11-21 16:53:12,011 INFO L899 garLoopResultBuilder]: For program point L3915(lines 3915 3918) no Hoare annotation was computed. [2022-11-21 16:53:12,011 INFO L899 garLoopResultBuilder]: For program point kbtab_initFINAL(lines 3909 3925) no Hoare annotation was computed. [2022-11-21 16:53:12,011 INFO L899 garLoopResultBuilder]: For program point L4210-1(line 4210) no Hoare annotation was computed. [2022-11-21 16:53:12,011 INFO L899 garLoopResultBuilder]: For program point dev_get_drvdataFINAL(lines 4209 4211) no Hoare annotation was computed. [2022-11-21 16:53:12,012 INFO L895 garLoopResultBuilder]: At program point dev_get_drvdataENTRY(lines 4209 4211) the Hoare annotation is: (or (not (<= 1 ~ldv_urb_state~0)) (not (<= 1 ~ldv_coherent_state~0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= 0 ~res_kbtab_probe_3~0)) (not (<= ~ldv_urb_state~0 1)) (not (<= ~ldv_coherent_state~0 1))) [2022-11-21 16:53:12,012 INFO L895 garLoopResultBuilder]: At program point L4210(line 4210) the Hoare annotation is: (or (not (<= 1 ~ldv_urb_state~0)) (not (<= 1 ~ldv_coherent_state~0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= 0 ~res_kbtab_probe_3~0)) (not (<= ~ldv_urb_state~0 1)) (not (<= ~ldv_coherent_state~0 1))) [2022-11-21 16:53:12,012 INFO L899 garLoopResultBuilder]: For program point dev_get_drvdataEXIT(lines 4209 4211) no Hoare annotation was computed. [2022-11-21 16:53:12,012 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 4264 4266) no Hoare annotation was computed. [2022-11-21 16:53:12,012 INFO L895 garLoopResultBuilder]: At program point kfreeENTRY(lines 4264 4266) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (= |old(#valid)| |#valid|)) [2022-11-21 16:53:12,013 INFO L899 garLoopResultBuilder]: For program point kfreeFINAL(lines 4264 4266) no Hoare annotation was computed. [2022-11-21 16:53:12,013 INFO L899 garLoopResultBuilder]: For program point L3437-1(line 3437) no Hoare annotation was computed. [2022-11-21 16:53:12,013 INFO L902 garLoopResultBuilder]: At program point L3437(line 3437) the Hoare annotation is: true [2022-11-21 16:53:12,013 INFO L902 garLoopResultBuilder]: At program point usb_set_intfdataENTRY(lines 3433 3441) the Hoare annotation is: true [2022-11-21 16:53:12,013 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataFINAL(lines 3433 3441) no Hoare annotation was computed. [2022-11-21 16:53:12,013 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataEXIT(lines 3433 3441) no Hoare annotation was computed. [2022-11-21 16:53:12,013 INFO L899 garLoopResultBuilder]: For program point L4239(line 4239) no Hoare annotation was computed. [2022-11-21 16:53:12,013 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerFINAL(lines 4238 4240) no Hoare annotation was computed. [2022-11-21 16:53:12,014 INFO L895 garLoopResultBuilder]: At program point ldv_undefined_pointerENTRY(lines 4238 4240) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_urb_state~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (= 0 ~res_kbtab_probe_3~0)))) (and (or .cse0 (not (<= 1 ~ldv_coherent_state~0)) .cse1 .cse2 (not (<= ~ldv_coherent_state~0 1))) (or (not (= ~ldv_coherent_state~0 0)) .cse0 .cse1 .cse2))) [2022-11-21 16:53:12,014 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerEXIT(lines 4238 4240) no Hoare annotation was computed. [2022-11-21 16:53:12,014 INFO L902 garLoopResultBuilder]: At program point L4158(line 4158) the Hoare annotation is: true [2022-11-21 16:53:12,014 INFO L899 garLoopResultBuilder]: For program point L4156(lines 4154 4173) no Hoare annotation was computed. [2022-11-21 16:53:12,014 INFO L895 garLoopResultBuilder]: At program point L4154loopEntry(lines 4154 4173) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (not (<= 1 |old(~ldv_urb_state~0)|)) (not (<= 1 ~ldv_coherent_state~0)) (not (= 0 ~res_kbtab_probe_3~0)) (not (<= ~ldv_coherent_state~0 1))) [2022-11-21 16:53:12,014 INFO L899 garLoopResultBuilder]: For program point usb_free_urbEXIT(lines 4150 4179) no Hoare annotation was computed. [2022-11-21 16:53:12,024 INFO L895 garLoopResultBuilder]: At program point usb_free_urbENTRY(lines 4150 4179) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (not (<= 1 |old(~ldv_urb_state~0)|)) (not (<= 1 ~ldv_coherent_state~0)) (not (= 0 ~res_kbtab_probe_3~0)) (not (<= ~ldv_coherent_state~0 1))) [2022-11-21 16:53:12,024 INFO L899 garLoopResultBuilder]: For program point L4163(lines 4163 4168) no Hoare annotation was computed. [2022-11-21 16:53:12,025 INFO L899 garLoopResultBuilder]: For program point L4155(lines 4154 4173) no Hoare annotation was computed. [2022-11-21 16:53:12,025 INFO L895 garLoopResultBuilder]: At program point L4174(lines 4150 4179) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (and (= ~ldv_urb_state~0 0) (let ((.cse0 (+ usb_free_urb_~urb.base usb_free_urb_~urb.offset))) (let ((.cse1 (div .cse0 18446744073709551616))) (or (not (<= .cse0 (* .cse1 18446744073709551616))) (<= (+ .cse1 1) 0))))) (not (<= 1 |old(~ldv_urb_state~0)|)) (not (<= 1 ~ldv_coherent_state~0)) (not (= 0 ~res_kbtab_probe_3~0)) (not (<= ~ldv_coherent_state~0 1))) [2022-11-21 16:53:12,025 INFO L895 garLoopResultBuilder]: At program point L4166(line 4166) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (not (<= 1 |old(~ldv_urb_state~0)|)) (not (<= 1 ~ldv_coherent_state~0)) (not (= 0 ~res_kbtab_probe_3~0)) (not (<= ~ldv_coherent_state~0 1))) [2022-11-21 16:53:12,025 INFO L899 garLoopResultBuilder]: For program point L4166-1(lines 4163 4168) no Hoare annotation was computed. [2022-11-21 16:53:12,026 INFO L899 garLoopResultBuilder]: For program point input_set_abs_paramsEXIT(lines 4226 4228) no Hoare annotation was computed. [2022-11-21 16:53:12,026 INFO L902 garLoopResultBuilder]: At program point input_set_abs_paramsENTRY(lines 4226 4228) the Hoare annotation is: true [2022-11-21 16:53:12,027 INFO L899 garLoopResultBuilder]: For program point input_set_abs_paramsFINAL(lines 4226 4228) no Hoare annotation was computed. [2022-11-21 16:53:12,027 INFO L899 garLoopResultBuilder]: For program point kbtab_exitFINAL(lines 3928 3936) no Hoare annotation was computed. [2022-11-21 16:53:12,027 INFO L902 garLoopResultBuilder]: At program point L4250(lines 4249 4251) the Hoare annotation is: true [2022-11-21 16:53:12,027 INFO L902 garLoopResultBuilder]: At program point kbtab_exitENTRY(lines 3928 3936) the Hoare annotation is: true [2022-11-21 16:53:12,027 INFO L899 garLoopResultBuilder]: For program point kbtab_exitEXIT(lines 3928 3936) no Hoare annotation was computed. [2022-11-21 16:53:12,028 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 4201 4205) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_urb_state~0 0))) (.cse1 (not (<= 1 ~ldv_coherent_state~0))) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse3 (not (= 0 ~res_kbtab_probe_3~0))) (.cse4 (not (<= ~ldv_coherent_state~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or (not (= ~ldv_coherent_state~0 0)) .cse0 .cse2 .cse3) (or (not (<= 1 ~ldv_urb_state~0)) .cse1 .cse2 .cse3 (not (<= ~ldv_urb_state~0 1)) .cse4))) [2022-11-21 16:53:12,028 INFO L899 garLoopResultBuilder]: For program point L4203(line 4203) no Hoare annotation was computed. [2022-11-21 16:53:12,028 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 4201 4205) no Hoare annotation was computed. [2022-11-21 16:53:12,029 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 4201 4205) no Hoare annotation was computed. [2022-11-21 16:53:12,029 INFO L895 garLoopResultBuilder]: At program point L4207(line 4207) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-21 16:53:12,030 INFO L899 garLoopResultBuilder]: For program point L4207-1(line 4207) no Hoare annotation was computed. [2022-11-21 16:53:12,031 INFO L902 garLoopResultBuilder]: At program point L4207-2(lines 4206 4208) the Hoare annotation is: true [2022-11-21 16:53:12,031 INFO L899 garLoopResultBuilder]: For program point kzallocEXIT(lines 3405 3413) no Hoare annotation was computed. [2022-11-21 16:53:12,031 INFO L902 garLoopResultBuilder]: At program point L3401(lines 3394 3403) the Hoare annotation is: true [2022-11-21 16:53:12,032 INFO L895 garLoopResultBuilder]: At program point kzallocENTRY(lines 3405 3413) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-21 16:53:12,032 INFO L899 garLoopResultBuilder]: For program point kzallocFINAL(lines 3405 3413) no Hoare annotation was computed. [2022-11-21 16:53:12,032 INFO L902 garLoopResultBuilder]: At program point ldv_assume_stopENTRY(lines 4055 4061) the Hoare annotation is: true [2022-11-21 16:53:12,032 INFO L899 garLoopResultBuilder]: For program point ldv_assume_stopEXIT(lines 4055 4061) no Hoare annotation was computed. [2022-11-21 16:53:12,033 INFO L895 garLoopResultBuilder]: At program point L4117(lines 4093 4122) the Hoare annotation is: (or (not (<= 1 |old(~ldv_coherent_state~0)|)) (not (<= |old(~ldv_coherent_state~0)| 1)) (not (= ~ldv_urb_state~0 0)) (and (= ~ldv_coherent_state~0 0) (let ((.cse0 (+ usb_free_coherent_~addr.base usb_free_coherent_~addr.offset))) (let ((.cse1 (div .cse0 18446744073709551616))) (or (not (<= .cse0 (* 18446744073709551616 .cse1))) (<= (+ .cse1 1) 0)))))) [2022-11-21 16:53:12,033 INFO L895 garLoopResultBuilder]: At program point usb_free_coherentENTRY(lines 4093 4122) the Hoare annotation is: (or (not (<= 1 |old(~ldv_coherent_state~0)|)) (not (<= |old(~ldv_coherent_state~0)| 1)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (not (= ~ldv_urb_state~0 0))) [2022-11-21 16:53:12,033 INFO L899 garLoopResultBuilder]: For program point L4109-1(lines 4106 4111) no Hoare annotation was computed. [2022-11-21 16:53:12,033 INFO L895 garLoopResultBuilder]: At program point L4109(line 4109) the Hoare annotation is: (or (not (<= 1 |old(~ldv_coherent_state~0)|)) (not (<= |old(~ldv_coherent_state~0)| 1)) (not (= ~ldv_urb_state~0 0))) [2022-11-21 16:53:12,033 INFO L899 garLoopResultBuilder]: For program point usb_free_coherentEXIT(lines 4093 4122) no Hoare annotation was computed. [2022-11-21 16:53:12,034 INFO L902 garLoopResultBuilder]: At program point L4101(line 4101) the Hoare annotation is: true [2022-11-21 16:53:12,034 INFO L899 garLoopResultBuilder]: For program point L4099(lines 4097 4116) no Hoare annotation was computed. [2022-11-21 16:53:12,034 INFO L895 garLoopResultBuilder]: At program point L4097loopEntry(lines 4097 4116) the Hoare annotation is: (or (not (<= 1 |old(~ldv_coherent_state~0)|)) (not (<= |old(~ldv_coherent_state~0)| 1)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (not (= ~ldv_urb_state~0 0))) [2022-11-21 16:53:12,035 INFO L899 garLoopResultBuilder]: For program point L4106(lines 4106 4111) no Hoare annotation was computed. [2022-11-21 16:53:12,035 INFO L899 garLoopResultBuilder]: For program point L4098(lines 4097 4116) no Hoare annotation was computed. [2022-11-21 16:53:12,035 INFO L895 garLoopResultBuilder]: At program point L4032(lines 3979 4033) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-21 16:53:12,035 INFO L899 garLoopResultBuilder]: For program point L3487(lines 3487 3494) no Hoare annotation was computed. [2022-11-21 16:53:12,036 INFO L895 garLoopResultBuilder]: At program point L3454-1(line 3454) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-21 16:53:12,036 INFO L895 garLoopResultBuilder]: At program point L3867(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)))) [2022-11-21 16:53:12,036 INFO L895 garLoopResultBuilder]: At program point L4247(lines 4246 4248) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-21 16:53:12,036 INFO L895 garLoopResultBuilder]: At program point L3884(line 3884) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-21 16:53:12,037 INFO L899 garLoopResultBuilder]: For program point L3851(lines 3851 3854) no Hoare annotation was computed. [2022-11-21 16:53:12,037 INFO L899 garLoopResultBuilder]: For program point L3884-1(line 3884) no Hoare annotation was computed. [2022-11-21 16:53:12,037 INFO L899 garLoopResultBuilder]: For program point L4132(line 4132) no Hoare annotation was computed. [2022-11-21 16:53:12,037 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-21 16:53:12,037 INFO L899 garLoopResultBuilder]: For program point L3802(lines 3802 3808) no Hoare annotation was computed. [2022-11-21 16:53:12,038 INFO L895 garLoopResultBuilder]: At program point L3852(lines 3793 3873) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) [2022-11-21 16:53:12,038 INFO L899 garLoopResultBuilder]: For program point L3885-1(line 3885) no Hoare annotation was computed. [2022-11-21 16:53:12,038 INFO L895 garLoopResultBuilder]: At program point L3885(line 3885) the Hoare annotation is: (and (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0) (<= ~ldv_coherent_state~0 1) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-21 16:53:12,038 INFO L899 garLoopResultBuilder]: For program point L3456(lines 3456 3460) no Hoare annotation was computed. [2022-11-21 16:53:12,038 INFO L899 garLoopResultBuilder]: For program point L3456-2(lines 3456 3460) no Hoare annotation was computed. [2022-11-21 16:53:12,039 INFO L899 garLoopResultBuilder]: For program point L3985(lines 3985 3990) no Hoare annotation was computed. [2022-11-21 16:53:12,039 INFO L895 garLoopResultBuilder]: At program point L3886(line 3886) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-21 16:53:12,039 INFO L899 garLoopResultBuilder]: For program point L3820(lines 3820 3823) no Hoare annotation was computed. [2022-11-21 16:53:12,039 INFO L895 garLoopResultBuilder]: At program point L3886-1(lines 3875 3890) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-21 16:53:12,040 INFO L895 garLoopResultBuilder]: At program point L4233(lines 4232 4234) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse5 (= 0 ~res_kbtab_probe_3~0)) (.cse4 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse3 (= |ULTIMATE.start_kbtab_probe_#res#1| 0))) (or (and .cse0 (<= (+ 12 ~res_kbtab_probe_3~0) 0) .cse1 (<= (+ |ULTIMATE.start_kbtab_probe_#res#1| 12) 0) .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (not .cse3) .cse4 .cse1 .cse2 (not .cse5)) (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) .cse5 .cse4 (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) .cse2 .cse3))) [2022-11-21 16:53:12,040 INFO L899 garLoopResultBuilder]: For program point L3490(lines 3490 3494) no Hoare annotation was computed. [2022-11-21 16:53:12,040 INFO L899 garLoopResultBuilder]: For program point L3490-2(lines 3487 3494) no Hoare annotation was computed. [2022-11-21 16:53:12,040 INFO L895 garLoopResultBuilder]: At program point L3870(line 3870) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)))) [2022-11-21 16:53:12,040 INFO L899 garLoopResultBuilder]: For program point L3870-1(line 3870) no Hoare annotation was computed. [2022-11-21 16:53:12,041 INFO L899 garLoopResultBuilder]: For program point L4184(lines 4184 4189) no Hoare annotation was computed. [2022-11-21 16:53:12,041 INFO L899 garLoopResultBuilder]: For program point L4135(lines 4135 4138) no Hoare annotation was computed. [2022-11-21 16:53:12,041 INFO L899 garLoopResultBuilder]: For program point L3805(lines 3805 3808) no Hoare annotation was computed. [2022-11-21 16:53:12,041 INFO L899 garLoopResultBuilder]: For program point L4086(lines 4071 4087) no Hoare annotation was computed. [2022-11-21 16:53:12,041 INFO L899 garLoopResultBuilder]: For program point L3987-1(lines 3985 3990) no Hoare annotation was computed. [2022-11-21 16:53:12,042 INFO L899 garLoopResultBuilder]: For program point L3987(lines 3987 3990) no Hoare annotation was computed. [2022-11-21 16:53:12,043 INFO L895 garLoopResultBuilder]: At program point L4037(lines 3968 4044) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-21 16:53:12,043 INFO L895 garLoopResultBuilder]: At program point L3426(line 3426) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-21 16:53:12,043 INFO L895 garLoopResultBuilder]: At program point L3872(lines 3782 3874) the Hoare annotation is: (let ((.cse4 (= ~ldv_coherent_state~0 0)) (.cse0 (= 0 ~res_kbtab_probe_3~0)) (.cse3 (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) (.cse1 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse5 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) .cse0 .cse1 (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) .cse2 .cse3) (and .cse4 .cse5 (<= (+ |ULTIMATE.start_kbtab_probe_#res#1| 12) 0) .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse4 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse0 (not .cse3) .cse1 .cse5 .cse2))) [2022-11-21 16:53:12,043 INFO L899 garLoopResultBuilder]: For program point L3426-1(line 3426) no Hoare annotation was computed. [2022-11-21 16:53:12,044 INFO L895 garLoopResultBuilder]: At program point L3839-1(line 3839) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-21 16:53:12,044 INFO L895 garLoopResultBuilder]: At program point L3839(line 3839) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-21 16:53:12,044 INFO L895 garLoopResultBuilder]: At program point L3509(lines 3506 3511) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-21 16:53:12,045 INFO L895 garLoopResultBuilder]: At program point L3856(line 3856) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) [2022-11-21 16:53:12,045 INFO L899 garLoopResultBuilder]: For program point L3856-1(line 3856) no Hoare annotation was computed. [2022-11-21 16:53:12,045 INFO L895 garLoopResultBuilder]: At program point L4236(lines 4235 4237) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0)) [2022-11-21 16:53:12,045 INFO L895 garLoopResultBuilder]: At program point L3972(line 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0)) [2022-11-21 16:53:12,045 INFO L899 garLoopResultBuilder]: For program point L3972-1(line 3972) no Hoare annotation was computed. [2022-11-21 16:53:12,046 INFO L895 garLoopResultBuilder]: At program point L3840(line 3840) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-21 16:53:12,046 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-21 16:53:12,046 INFO L899 garLoopResultBuilder]: For program point L4187-1(lines 4183 4197) no Hoare annotation was computed. [2022-11-21 16:53:12,046 INFO L895 garLoopResultBuilder]: At program point L4220(lines 4219 4221) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)))) [2022-11-21 16:53:12,047 INFO L895 garLoopResultBuilder]: At program point L4187(line 4187) the Hoare annotation is: false [2022-11-21 16:53:12,047 INFO L895 garLoopResultBuilder]: At program point L3576(lines 3569 3578) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-21 16:53:12,047 INFO L895 garLoopResultBuilder]: At program point L4072loopEntry(lines 4072 4085) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-21 16:53:12,047 INFO L895 garLoopResultBuilder]: At program point L3428(lines 3422 3430) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-21 16:53:12,048 INFO L895 garLoopResultBuilder]: At program point L3461(lines 3449 3463) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-21 16:53:12,048 INFO L899 garLoopResultBuilder]: For program point L3841(line 3841) no Hoare annotation was computed. [2022-11-21 16:53:12,048 INFO L895 garLoopResultBuilder]: At program point L4089(lines 4066 4091) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse3 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse2 (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (.cse4 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0))) (or (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) .cse0 .cse1 (= |ULTIMATE.start_usb_alloc_coherent_#res#1.offset| 0) .cse2 .cse3 .cse4) (and (not .cse0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) .cse1 (<= ~ldv_coherent_state~0 1) .cse3 (not .cse2) .cse4))) [2022-11-21 16:53:12,048 INFO L895 garLoopResultBuilder]: At program point L4073(line 4073) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-21 16:53:12,049 INFO L899 garLoopResultBuilder]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2022-11-21 16:53:12,049 INFO L895 garLoopResultBuilder]: At program point L3446(lines 3442 3448) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) [2022-11-21 16:53:12,049 INFO L899 garLoopResultBuilder]: For program point L3529-1(line 3529) no Hoare annotation was computed. [2022-11-21 16:53:12,049 INFO L895 garLoopResultBuilder]: At program point L3496(lines 3475 3498) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-21 16:53:12,050 INFO L899 garLoopResultBuilder]: For program point L4008(lines 4008 4011) no Hoare annotation was computed. [2022-11-21 16:53:12,050 INFO L895 garLoopResultBuilder]: At program point L3529(line 3529) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-21 16:53:12,050 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-21 16:53:12,050 INFO L899 garLoopResultBuilder]: For program point L3513-1(line 3513) no Hoare annotation was computed. [2022-11-21 16:53:12,050 INFO L895 garLoopResultBuilder]: At program point L3513(line 3513) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse3 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0))) (or (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 .cse3) (and .cse0 (= |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base| 0) .cse1 .cse2 (= |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset| 0) .cse3))) [2022-11-21 16:53:12,052 INFO L895 garLoopResultBuilder]: At program point L3513-2(lines 3512 3514) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse3 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0))) (or (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 .cse3) (and .cse0 (= |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base| 0) .cse1 .cse2 (= |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset| 0) .cse3))) [2022-11-21 16:53:12,052 INFO L899 garLoopResultBuilder]: For program point L4075(line 4075) no Hoare annotation was computed. [2022-11-21 16:53:12,052 INFO L895 garLoopResultBuilder]: At program point L4224(lines 4223 4225) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-21 16:53:12,053 INFO L899 garLoopResultBuilder]: For program point L3861-1(line 3861) no Hoare annotation was computed. [2022-11-21 16:53:12,053 INFO L895 garLoopResultBuilder]: At program point L3861(line 3861) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) [2022-11-21 16:53:12,053 INFO L895 garLoopResultBuilder]: At program point L3531(lines 3525 3533) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-21 16:53:12,053 INFO L895 garLoopResultBuilder]: At program point L4043(lines 3961 4045) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2022-11-21 16:53:12,054 INFO L899 garLoopResultBuilder]: For program point L3994(lines 3994 4030) no Hoare annotation was computed. [2022-11-21 16:53:12,054 INFO L899 garLoopResultBuilder]: For program point L4143(lines 4128 4144) no Hoare annotation was computed. [2022-11-21 16:53:12,054 INFO L899 garLoopResultBuilder]: For program point L3813(lines 3813 3816) no Hoare annotation was computed. [2022-11-21 16:53:12,054 INFO L895 garLoopResultBuilder]: At program point L4193-1(lines 4181 4198) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2022-11-21 16:53:12,054 INFO L895 garLoopResultBuilder]: At program point L4193(line 4193) the Hoare annotation is: false [2022-11-21 16:53:12,055 INFO L895 garLoopResultBuilder]: At program point L4028(lines 3980 4031) the Hoare annotation is: (let ((.cse5 (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (.cse0 (<= 1 ~ldv_coherent_state~0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse4 (<= ~ldv_coherent_state~0 1)) (.cse6 (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) (.cse7 (= ~ldv_coherent_state~0 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse5) (and (<= 1 ~ldv_urb_state~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~ldv_urb_state~0 1) .cse6) (and .cse7 .cse1 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)))) [2022-11-21 16:53:12,055 INFO L895 garLoopResultBuilder]: At program point L3995(lines 3994 4030) the Hoare annotation is: (let ((.cse5 (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (.cse0 (<= 1 ~ldv_coherent_state~0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse4 (<= ~ldv_coherent_state~0 1)) (.cse6 (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) (.cse7 (= ~ldv_coherent_state~0 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse5) (and (<= 1 ~ldv_urb_state~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~ldv_urb_state~0 1) .cse6) (and .cse7 .cse1 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)))) [2022-11-21 16:53:12,055 INFO L895 garLoopResultBuilder]: At program point L3863(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|))) (.cse1 (<= 1 ~ldv_coherent_state~0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse3 (= ~ldv_urb_state~0 0)) (.cse4 (<= ~ldv_coherent_state~0 1)) (.cse5 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse6 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)))) (or (and .cse0 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse1 (= 0 ~res_kbtab_probe_3~0) .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-11-21 16:53:12,056 INFO L899 garLoopResultBuilder]: For program point L4078(lines 4078 4081) no Hoare annotation was computed. [2022-11-21 16:53:12,056 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-21 16:53:12,056 INFO L895 garLoopResultBuilder]: At program point L3798(line 3798) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-21 16:53:12,056 INFO L899 garLoopResultBuilder]: For program point L3798-1(line 3798) no Hoare annotation was computed. [2022-11-21 16:53:12,056 INFO L895 garLoopResultBuilder]: At program point L4129loopEntry(lines 4129 4142) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (<= ~ldv_coherent_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-21 16:53:12,057 INFO L899 garLoopResultBuilder]: For program point L3997(lines 3997 4030) no Hoare annotation was computed. [2022-11-21 16:53:12,057 INFO L899 garLoopResultBuilder]: For program point L3865-1(line 3865) no Hoare annotation was computed. [2022-11-21 16:53:12,058 INFO L895 garLoopResultBuilder]: At program point L3865(line 3865) the Hoare annotation is: (let ((.cse0 (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|))) (.cse1 (<= 1 ~ldv_coherent_state~0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse3 (= ~ldv_urb_state~0 0)) (.cse4 (<= ~ldv_coherent_state~0 1)) (.cse5 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse6 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)))) (or (and .cse0 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse1 (= 0 ~res_kbtab_probe_3~0) .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-11-21 16:53:12,058 INFO L895 garLoopResultBuilder]: At program point L4146(lines 4124 4148) the Hoare annotation is: (let ((.cse4 (= ~ldv_urb_state~0 0)) (.cse9 (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) (.cse0 (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|))) (.cse1 (<= 1 ~ldv_coherent_state~0)) (.cse10 (= 0 ~res_kbtab_probe_3~0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse5 (<= ~ldv_coherent_state~0 1)) (.cse6 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse7 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (.cse8 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0))) (or (and .cse0 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (<= 1 ~ldv_urb_state~0) .cse1 .cse10 .cse2 .cse5 (<= ~ldv_urb_state~0 1) .cse6 .cse7 (not .cse3) .cse8))) [2022-11-21 16:53:12,058 INFO L899 garLoopResultBuilder]: For program point L3981(line 3981) no Hoare annotation was computed. [2022-11-21 16:53:12,059 INFO L895 garLoopResultBuilder]: At program point L3882(line 3882) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-21 16:53:12,059 INFO L899 garLoopResultBuilder]: For program point L3882-1(line 3882) no Hoare annotation was computed. [2022-11-21 16:53:12,059 INFO L895 garLoopResultBuilder]: At program point L4130(line 4130) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (<= ~ldv_coherent_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-21 16:53:12,059 INFO L895 garLoopResultBuilder]: At program point L3998(lines 3997 4030) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse6 (<= 1 ~ldv_coherent_state~0)) (.cse1 (= 0 ~res_kbtab_probe_3~0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| |ULTIMATE.start_main_~tmp___8~3#1|))) (.cse7 (<= ~ldv_coherent_state~0 1)) (.cse5 (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (.cse8 (= |ULTIMATE.start_kbtab_probe_#res#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse4 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (and (<= 1 ~ldv_urb_state~0) .cse6 .cse1 .cse2 .cse3 .cse7 (<= ~ldv_urb_state~0 1) .cse8) (and .cse6 .cse1 .cse2 .cse3 .cse4 .cse7 .cse5 .cse8))) [2022-11-21 16:53:12,060 INFO L895 garLoopResultBuilder]: At program point L4230(lines 4229 4231) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-21 16:53:12,060 INFO L902 garLoopResultBuilder]: At program point ldv_blast_assertENTRY(lines 4046 4051) the Hoare annotation is: true [2022-11-21 16:53:12,060 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertEXIT(lines 4046 4051) no Hoare annotation was computed. [2022-11-21 16:53:12,060 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertFINAL(lines 4046 4051) no Hoare annotation was computed. [2022-11-21 16:53:12,061 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2022-11-21 16:53:12,061 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataFINAL(lines 4213 4215) no Hoare annotation was computed. [2022-11-21 16:53:12,062 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 4213 4215) no Hoare annotation was computed. [2022-11-21 16:53:12,062 INFO L902 garLoopResultBuilder]: At program point dev_set_drvdataENTRY(lines 4213 4215) the Hoare annotation is: true [2022-11-21 16:53:12,067 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:53:12,069 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:53:12,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:53:12 BoogieIcfgContainer [2022-11-21 16:53:12,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:53:12,146 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:53:12,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:53:12,147 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:53:12,149 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:52:23" (3/4) ... [2022-11-21 16:53:12,152 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-21 16:53:12,160 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_init [2022-11-21 16:53:12,160 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_get_drvdata [2022-11-21 16:53:12,161 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2022-11-21 16:53:12,161 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2022-11-21 16:53:12,161 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2022-11-21 16:53:12,161 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2022-11-21 16:53:12,161 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_abs_params [2022-11-21 16:53:12,162 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_exit [2022-11-21 16:53:12,162 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-21 16:53:12,162 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2022-11-21 16:53:12,162 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2022-11-21 16:53:12,162 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2022-11-21 16:53:12,163 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2022-11-21 16:53:12,163 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2022-11-21 16:53:12,187 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 77 nodes and edges [2022-11-21 16:53:12,189 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2022-11-21 16:53:12,191 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-21 16:53:12,192 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-21 16:53:12,193 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 16:53:12,195 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-21 16:53:12,245 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && !(ldv_s_kbtab_driver_usb_driver == 1)) && \result == 0) || ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == 1))) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) [2022-11-21 16:53:12,246 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(ldv_urb_state) <= 1) || (ldv_urb_state == 0 && (!(urb + urb <= (urb + urb) / 18446744073709551616 * 18446744073709551616) || (urb + urb) / 18446744073709551616 + 1 <= 0))) || !(1 <= \old(ldv_urb_state))) || !(1 <= ldv_coherent_state)) || !(0 == res_kbtab_probe_3)) || !(ldv_coherent_state <= 1) [2022-11-21 16:53:12,246 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(1 <= \old(ldv_coherent_state)) || !(\old(ldv_coherent_state) <= 1)) || !(ldv_urb_state == 0)) || (ldv_coherent_state == 0 && (!(addr + addr <= 18446744073709551616 * ((addr + addr) / 18446744073709551616)) || (addr + addr) / 18446744073709551616 + 1 <= 0)) [2022-11-21 16:53:12,246 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && arbitrary_memory == 0) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) || ((((((((!(0 == arbitrary_memory) && !(error == 0)) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) [2022-11-21 16:53:12,246 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && !(ldv_s_kbtab_driver_usb_driver == 1)) && \result == 0) || ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == 1))) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) [2022-11-21 16:53:12,247 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && !(ldv_s_kbtab_driver_usb_driver == 1)) || ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0)) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0)) || (((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_coherent_state <= 1) && !(ldv_s_kbtab_driver_usb_driver == 1)) && \result == 0) [2022-11-21 16:53:12,247 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_urb_state == 0) && \result == 0 [2022-11-21 16:53:12,250 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(1 <= \old(ldv_coherent_state)) || !(\old(ldv_coherent_state) <= 1)) || \old(ldv_coherent_state) == ldv_coherent_state) || !(ldv_urb_state == 0) [2022-11-21 16:53:12,251 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || ((((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0)) || ((((((ldv_coherent_state == 0 && !(error == 0)) && 0 == res_kbtab_probe_3) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) [2022-11-21 16:53:12,251 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && 12 + res_kbtab_probe_3 <= 0) && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((ldv_coherent_state == 0 && !(error == 0)) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(0 == res_kbtab_probe_3))) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) [2022-11-21 16:53:12,251 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0 [2022-11-21 16:53:12,252 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0 [2022-11-21 16:53:12,252 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && 0 == arbitrary_memory) && ldv_urb_state == 0) && \result == 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || (((((((!(0 == arbitrary_memory) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) [2022-11-21 16:53:12,252 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(0 == arbitrary_memory) && arbitrary_memory == 0) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) && 0 == \result) || ((((((((((!(0 == arbitrary_memory) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) && 0 == \result)) || ((((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && error + 12 <= 0) [2022-11-21 16:53:12,253 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-21 16:53:12,253 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(ldv_urb_state) <= 1) || ldv_urb_state == \old(ldv_urb_state)) || !(1 <= \old(ldv_urb_state))) || !(1 <= ldv_coherent_state)) || !(0 == res_kbtab_probe_3)) || !(ldv_coherent_state <= 1) [2022-11-21 16:53:12,255 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == arbitrary_memory) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-21 16:53:12,256 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-21 16:53:12,256 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-21 16:53:12,257 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-21 16:53:12,257 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-21 16:53:12,257 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-21 16:53:12,257 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-21 16:53:12,258 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-21 16:53:12,258 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && !(error == 0)) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0) [2022-11-21 16:53:12,404 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 16:53:12,404 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:53:12,405 INFO L158 Benchmark]: Toolchain (without parser) took 52445.35ms. Allocated memory was 167.8MB in the beginning and 786.4MB in the end (delta: 618.7MB). Free memory was 122.9MB in the beginning and 437.7MB in the end (delta: -314.8MB). Peak memory consumption was 305.1MB. Max. memory is 16.1GB. [2022-11-21 16:53:12,406 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 113.2MB. Free memory is still 80.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:53:12,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1415.83ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 78.0MB in the end (delta: 44.5MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2022-11-21 16:53:12,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 142.86ms. Allocated memory is still 167.8MB. Free memory was 78.0MB in the beginning and 72.3MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-21 16:53:12,407 INFO L158 Benchmark]: Boogie Preprocessor took 147.81ms. Allocated memory is still 167.8MB. Free memory was 72.3MB in the beginning and 66.8MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-21 16:53:12,407 INFO L158 Benchmark]: RCFGBuilder took 1801.98ms. Allocated memory was 167.8MB in the beginning and 205.5MB in the end (delta: 37.7MB). Free memory was 66.8MB in the beginning and 127.8MB in the end (delta: -61.1MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. [2022-11-21 16:53:12,408 INFO L158 Benchmark]: TraceAbstraction took 48669.73ms. Allocated memory was 205.5MB in the beginning and 786.4MB in the end (delta: 580.9MB). Free memory was 126.8MB in the beginning and 457.0MB in the end (delta: -330.3MB). Peak memory consumption was 440.4MB. Max. memory is 16.1GB. [2022-11-21 16:53:12,408 INFO L158 Benchmark]: Witness Printer took 258.52ms. Allocated memory is still 786.4MB. Free memory was 457.0MB in the beginning and 437.7MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-21 16:53:12,410 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.15ms. Allocated memory is still 113.2MB. Free memory is still 80.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1415.83ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 78.0MB in the end (delta: 44.5MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 142.86ms. Allocated memory is still 167.8MB. Free memory was 78.0MB in the beginning and 72.3MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 147.81ms. Allocated memory is still 167.8MB. Free memory was 72.3MB in the beginning and 66.8MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1801.98ms. Allocated memory was 167.8MB in the beginning and 205.5MB in the end (delta: 37.7MB). Free memory was 66.8MB in the beginning and 127.8MB in the end (delta: -61.1MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. * TraceAbstraction took 48669.73ms. Allocated memory was 205.5MB in the beginning and 786.4MB in the end (delta: 580.9MB). Free memory was 126.8MB in the beginning and 457.0MB in the end (delta: -330.3MB). Peak memory consumption was 440.4MB. Max. memory is 16.1GB. * Witness Printer took 258.52ms. Allocated memory is still 786.4MB. Free memory was 457.0MB in the beginning and 437.7MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. 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 - PositiveResult [Line: 4049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 165 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.5s, OverallIterations: 21, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4050 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3886 mSDsluCounter, 16218 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12190 mSDsCounter, 1203 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5574 IncrementalHoareTripleChecker+Invalid, 6777 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1203 mSolverCounterUnsat, 4028 mSDtfsCounter, 5574 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1615 GetRequests, 1397 SyntacticMatches, 5 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1175occurred in iteration=16, InterpolantAutomatonStates: 147, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 1596 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 82 LocationsWithAnnotation, 2821 PreInvPairs, 2961 NumberOfFragments, 2188 HoareAnnotationTreeSize, 2821 FomulaSimplifications, 268149 FormulaSimplificationTreeSizeReduction, 5.1s HoareSimplificationTime, 82 FomulaSimplificationsInter, 33710 FormulaSimplificationTreeSizeReductionInter, 5.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 2951 NumberOfCodeBlocks, 2922 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3004 ConstructedInterpolants, 0 QuantifiedInterpolants, 6227 SizeOfPredicates, 35 NumberOfNonLiveVariables, 11687 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 30 InterpolantComputations, 20 PerfectInterpolantSequences, 938/1004 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4055]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3782]: Loop Invariant Derived loop invariant: ((((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || ((((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0)) || ((((((ldv_coherent_state == 0 && !(error == 0)) && 0 == res_kbtab_probe_3) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4072]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0 - InvariantResult [Line: 3512]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || (((((ldv_coherent_state == 0 && kbtab == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) && error + 12 <= 0) - InvariantResult [Line: 3449]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3465]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4181]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 4229]: Loop Invariant Derived loop invariant: ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0 - InvariantResult [Line: 3525]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4256]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3422]: Loop Invariant Derived loop invariant: ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0 - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && !(error == 0)) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0) - InvariantResult [Line: 4097]: Loop Invariant Derived loop invariant: ((!(1 <= \old(ldv_coherent_state)) || !(\old(ldv_coherent_state) <= 1)) || \old(ldv_coherent_state) == ldv_coherent_state) || !(ldv_urb_state == 0) - InvariantResult [Line: 3442]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3475]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && arbitrary_memory == 0) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) || ((((((((!(0 == arbitrary_memory) && !(error == 0)) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) - InvariantResult [Line: 4093]: Loop Invariant Derived loop invariant: ((!(1 <= \old(ldv_coherent_state)) || !(\old(ldv_coherent_state) <= 1)) || !(ldv_urb_state == 0)) || (ldv_coherent_state == 0 && (!(addr + addr <= 18446744073709551616 * ((addr + addr) / 18446744073709551616)) || (addr + addr) / 18446744073709551616 + 1 <= 0)) - InvariantResult [Line: 3875]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 3994]: Loop Invariant Derived loop invariant: ((((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && !(ldv_s_kbtab_driver_usb_driver == 1)) && \result == 0) || ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == 1))) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4249]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3961]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 3980]: Loop Invariant Derived loop invariant: ((((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && !(ldv_s_kbtab_driver_usb_driver == 1)) && \result == 0) || ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == 1))) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4129]: Loop Invariant Derived loop invariant: ((((((!(0 == arbitrary_memory) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4232]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && 12 + res_kbtab_probe_3 <= 0) && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((ldv_coherent_state == 0 && !(error == 0)) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(0 == res_kbtab_probe_3))) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) - InvariantResult [Line: 4124]: Loop Invariant Derived loop invariant: (((((((((((!(0 == arbitrary_memory) && arbitrary_memory == 0) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) && 0 == \result) || ((((((((((!(0 == arbitrary_memory) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) && 0 == \result)) || ((((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && error + 12 <= 0) - InvariantResult [Line: 4219]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0 && !(error == 0)) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) - InvariantResult [Line: 3968]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4066]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && 0 == arbitrary_memory) && ldv_urb_state == 0) && \result == 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || (((((((!(0 == arbitrary_memory) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) - InvariantResult [Line: 4150]: Loop Invariant Derived loop invariant: ((((!(\old(ldv_urb_state) <= 1) || (ldv_urb_state == 0 && (!(urb + urb <= (urb + urb) / 18446744073709551616 * 18446744073709551616) || (urb + urb) / 18446744073709551616 + 1 <= 0))) || !(1 <= \old(ldv_urb_state))) || !(1 <= ldv_coherent_state)) || !(0 == res_kbtab_probe_3)) || !(ldv_coherent_state <= 1) - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0 && !(error == 0)) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) - InvariantResult [Line: 3394]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4246]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4154]: Loop Invariant Derived loop invariant: ((((!(\old(ldv_urb_state) <= 1) || ldv_urb_state == \old(ldv_urb_state)) || !(1 <= \old(ldv_urb_state))) || !(1 <= ldv_coherent_state)) || !(0 == res_kbtab_probe_3)) || !(ldv_coherent_state <= 1) - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3454]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4235]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0 - InvariantResult [Line: 3506]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3569]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3979]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3911]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3997]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && !(ldv_s_kbtab_driver_usb_driver == 1)) || ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0)) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0)) || (((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_coherent_state <= 1) && !(ldv_s_kbtab_driver_usb_driver == 1)) && \result == 0) RESULT: Ultimate proved your program to be correct! [2022-11-21 16:53:12,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bc64e4cc-0fd4-4596-8b1d-fc30b87e6d7c/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE