./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 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/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_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF --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 --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 06:23:14,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 06:23:14,984 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 06:23:15,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 06:23:15,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 06:23:15,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 06:23:15,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 06:23:15,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 06:23:15,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 06:23:15,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 06:23:15,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 06:23:15,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 06:23:15,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 06:23:15,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 06:23:15,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 06:23:15,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 06:23:15,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 06:23:15,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 06:23:15,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 06:23:15,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 06:23:15,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 06:23:15,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 06:23:15,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 06:23:15,050 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 06:23:15,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 06:23:15,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 06:23:15,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 06:23:15,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 06:23:15,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 06:23:15,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 06:23:15,059 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 06:23:15,060 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 06:23:15,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 06:23:15,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 06:23:15,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 06:23:15,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 06:23:15,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 06:23:15,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 06:23:15,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 06:23:15,067 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 06:23:15,067 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 06:23:15,069 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-20 06:23:15,094 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 06:23:15,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 06:23:15,095 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 06:23:15,095 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 06:23:15,096 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 06:23:15,096 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 06:23:15,097 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 06:23:15,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 06:23:15,098 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 06:23:15,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 06:23:15,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 06:23:15,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 06:23:15,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 06:23:15,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 06:23:15,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 06:23:15,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 06:23:15,101 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 06:23:15,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 06:23:15,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 06:23:15,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 06:23:15,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 06:23:15,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:23:15,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 06:23:15,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 06:23:15,105 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 06:23:15,105 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 06:23:15,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 06:23:15,106 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 06:23:15,106 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 06:23:15,107 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 06:23:15,107 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 06:23:15,107 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_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/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_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF 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 [2021-11-20 06:23:15,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 06:23:15,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 06:23:15,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 06:23:15,446 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 06:23:15,447 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 06:23:15,448 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2021-11-20 06:23:15,560 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/data/ef91e5fd6/618f3dd875df4d4e841f8e4d0f834bc2/FLAG134dc6c5b [2021-11-20 06:23:16,374 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 06:23:16,376 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2021-11-20 06:23:16,419 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/data/ef91e5fd6/618f3dd875df4d4e841f8e4d0f834bc2/FLAG134dc6c5b [2021-11-20 06:23:16,483 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/data/ef91e5fd6/618f3dd875df4d4e841f8e4d0f834bc2 [2021-11-20 06:23:16,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 06:23:16,487 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 06:23:16,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 06:23:16,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 06:23:16,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 06:23:16,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:23:16" (1/1) ... [2021-11-20 06:23:16,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c1b5359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:16, skipping insertion in model container [2021-11-20 06:23:16,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:23:16" (1/1) ... [2021-11-20 06:23:16,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 06:23:16,610 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:23:17,344 WARN L230 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_65e5624c-b583-4d11-8ba8-557b62007197/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2021-11-20 06:23:17,371 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:23:17,405 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 06:23:17,686 WARN L230 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_65e5624c-b583-4d11-8ba8-557b62007197/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2021-11-20 06:23:17,697 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:23:17,751 INFO L208 MainTranslator]: Completed translation [2021-11-20 06:23:17,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:17 WrapperNode [2021-11-20 06:23:17,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 06:23:17,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 06:23:17,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 06:23:17,757 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 06:23:17,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:17" (1/1) ... [2021-11-20 06:23:17,810 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:17" (1/1) ... [2021-11-20 06:23:17,888 INFO L137 Inliner]: procedures = 77, calls = 256, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 728 [2021-11-20 06:23:17,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 06:23:17,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 06:23:17,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 06:23:17,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 06:23:17,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:17" (1/1) ... [2021-11-20 06:23:17,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:17" (1/1) ... [2021-11-20 06:23:17,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:17" (1/1) ... [2021-11-20 06:23:17,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:17" (1/1) ... [2021-11-20 06:23:17,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:17" (1/1) ... [2021-11-20 06:23:17,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:17" (1/1) ... [2021-11-20 06:23:17,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:17" (1/1) ... [2021-11-20 06:23:17,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 06:23:17,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 06:23:17,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 06:23:17,962 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 06:23:17,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:17" (1/1) ... [2021-11-20 06:23:17,971 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:23:17,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:23:17,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 06:23:18,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 06:23:18,068 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2021-11-20 06:23:18,068 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2021-11-20 06:23:18,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 06:23:18,068 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2021-11-20 06:23:18,069 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2021-11-20 06:23:18,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-20 06:23:18,069 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2021-11-20 06:23:18,069 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2021-11-20 06:23:18,069 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2021-11-20 06:23:18,069 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2021-11-20 06:23:18,069 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2021-11-20 06:23:18,070 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2021-11-20 06:23:18,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 06:23:18,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-20 06:23:18,070 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2021-11-20 06:23:18,071 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2021-11-20 06:23:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-11-20 06:23:18,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-11-20 06:23:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2021-11-20 06:23:18,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2021-11-20 06:23:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 06:23:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2021-11-20 06:23:18,072 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2021-11-20 06:23:18,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-20 06:23:18,073 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-11-20 06:23:18,073 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-11-20 06:23:18,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 06:23:18,073 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-11-20 06:23:18,073 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-11-20 06:23:18,073 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2021-11-20 06:23:18,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2021-11-20 06:23:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2021-11-20 06:23:18,074 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2021-11-20 06:23:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2021-11-20 06:23:18,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2021-11-20 06:23:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 06:23:18,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 06:23:18,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 06:23:18,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 06:23:18,459 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 06:23:18,461 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 06:23:18,655 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2021-11-20 06:23:18,703 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-20 06:23:19,522 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-11-20 06:23:19,522 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-11-20 06:23:19,543 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 06:23:19,557 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 06:23:19,557 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-11-20 06:23:19,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:23:19 BoogieIcfgContainer [2021-11-20 06:23:19,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 06:23:19,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 06:23:19,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 06:23:19,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 06:23:19,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:23:16" (1/3) ... [2021-11-20 06:23:19,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e33fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:23:19, skipping insertion in model container [2021-11-20 06:23:19,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:17" (2/3) ... [2021-11-20 06:23:19,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e33fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:23:19, skipping insertion in model container [2021-11-20 06:23:19,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:23:19" (3/3) ... [2021-11-20 06:23:19,577 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2021-11-20 06:23:19,589 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 06:23:19,590 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 06:23:19,653 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 06:23:19,660 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 06:23:19,660 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 06:23:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 127 states have internal predecessors, (158), 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) [2021-11-20 06:23:19,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-20 06:23:19,692 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:19,693 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:23:19,694 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:19,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:19,700 INFO L85 PathProgramCache]: Analyzing trace with hash 567277314, now seen corresponding path program 1 times [2021-11-20 06:23:19,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:19,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547507239] [2021-11-20 06:23:19,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:19,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:20,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:23:20,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:20,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547507239] [2021-11-20 06:23:20,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547507239] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:20,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:23:20,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 06:23:20,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70677836] [2021-11-20 06:23:20,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:20,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 06:23:20,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:20,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 06:23:20,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 06:23:20,350 INFO L87 Difference]: Start difference. First operand has 163 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 127 states have internal predecessors, (158), 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) [2021-11-20 06:23:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:20,509 INFO L93 Difference]: Finished difference Result 447 states and 604 transitions. [2021-11-20 06:23:20,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 06:23:20,512 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 [2021-11-20 06:23:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:20,554 INFO L225 Difference]: With dead ends: 447 [2021-11-20 06:23:20,554 INFO L226 Difference]: Without dead ends: 287 [2021-11-20 06:23:20,560 INFO L932 BasicCegarLoop]: 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 [2021-11-20 06:23:20,564 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 184 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 408 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 [2021-11-20 06:23:20,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 408 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:23:20,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-11-20 06:23:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 283. [2021-11-20 06:23:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 210 states have (on average 1.2190476190476192) internal successors, (256), 214 states have internal predecessors, (256), 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) [2021-11-20 06:23:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 350 transitions. [2021-11-20 06:23:20,652 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 350 transitions. Word has length 17 [2021-11-20 06:23:20,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:20,653 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 350 transitions. [2021-11-20 06:23:20,653 INFO L471 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) [2021-11-20 06:23:20,654 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 350 transitions. [2021-11-20 06:23:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-20 06:23:20,655 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:20,655 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:23:20,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 06:23:20,656 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:20,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:20,656 INFO L85 PathProgramCache]: Analyzing trace with hash 405605840, now seen corresponding path program 1 times [2021-11-20 06:23:20,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:20,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796684677] [2021-11-20 06:23:20,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:20,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:20,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:23:20,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:20,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796684677] [2021-11-20 06:23:20,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796684677] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:20,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:23:20,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 06:23:20,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743351902] [2021-11-20 06:23:20,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:20,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 06:23:20,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:20,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 06:23:20,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 06:23:20,775 INFO L87 Difference]: Start difference. First operand 283 states and 350 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) [2021-11-20 06:23:20,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:20,881 INFO L93 Difference]: Finished difference Result 820 states and 1021 transitions. [2021-11-20 06:23:20,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 06:23:20,882 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 [2021-11-20 06:23:20,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:20,897 INFO L225 Difference]: With dead ends: 820 [2021-11-20 06:23:20,897 INFO L226 Difference]: Without dead ends: 542 [2021-11-20 06:23:20,904 INFO L932 BasicCegarLoop]: 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 [2021-11-20 06:23:20,905 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 174 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 417 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 [2021-11-20 06:23:20,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 417 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:23:20,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2021-11-20 06:23:21,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 535. [2021-11-20 06:23:21,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 398 states have (on average 1.2110552763819096) internal successors, (482), 401 states have internal predecessors, (482), 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) [2021-11-20 06:23:21,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 662 transitions. [2021-11-20 06:23:21,024 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 662 transitions. Word has length 18 [2021-11-20 06:23:21,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:21,025 INFO L470 AbstractCegarLoop]: Abstraction has 535 states and 662 transitions. [2021-11-20 06:23:21,026 INFO L471 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) [2021-11-20 06:23:21,026 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 662 transitions. [2021-11-20 06:23:21,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-20 06:23:21,029 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:21,030 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:23:21,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 06:23:21,030 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:21,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:21,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1497198459, now seen corresponding path program 1 times [2021-11-20 06:23:21,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:21,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967160831] [2021-11-20 06:23:21,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:21,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:21,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:21,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 06:23:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:21,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:21,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-20 06:23:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:21,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:23:21,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:21,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967160831] [2021-11-20 06:23:21,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967160831] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:21,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:23:21,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 06:23:21,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590085336] [2021-11-20 06:23:21,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:21,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:23:21,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:21,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:23:21,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:23:21,321 INFO L87 Difference]: Start difference. First operand 535 states and 662 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 06:23:21,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:21,718 INFO L93 Difference]: Finished difference Result 1114 states and 1383 transitions. [2021-11-20 06:23:21,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:23:21,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2021-11-20 06:23:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:21,729 INFO L225 Difference]: With dead ends: 1114 [2021-11-20 06:23:21,729 INFO L226 Difference]: Without dead ends: 587 [2021-11-20 06:23:21,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-20 06:23:21,739 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 53 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 06:23:21,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 846 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 06:23:21,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2021-11-20 06:23:21,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 535. [2021-11-20 06:23:21,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 398 states have (on average 1.2085427135678393) internal successors, (481), 401 states have internal predecessors, (481), 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) [2021-11-20 06:23:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 661 transitions. [2021-11-20 06:23:21,811 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 661 transitions. Word has length 51 [2021-11-20 06:23:21,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:21,812 INFO L470 AbstractCegarLoop]: Abstraction has 535 states and 661 transitions. [2021-11-20 06:23:21,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-20 06:23:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 661 transitions. [2021-11-20 06:23:21,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-20 06:23:21,817 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:21,818 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:23:21,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 06:23:21,818 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:21,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:21,819 INFO L85 PathProgramCache]: Analyzing trace with hash 748380995, now seen corresponding path program 1 times [2021-11-20 06:23:21,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:21,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95445602] [2021-11-20 06:23:21,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:21,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:21,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:21,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 06:23:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:21,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:21,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-11-20 06:23:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:21,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:23:21,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:21,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95445602] [2021-11-20 06:23:21,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95445602] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:21,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:23:21,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:23:21,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876466497] [2021-11-20 06:23:21,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:21,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:23:21,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:21,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:23:21,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:23:21,974 INFO L87 Difference]: Start difference. First operand 535 states and 661 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) [2021-11-20 06:23:22,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:22,365 INFO L93 Difference]: Finished difference Result 1233 states and 1565 transitions. [2021-11-20 06:23:22,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:23:22,366 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 [2021-11-20 06:23:22,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:22,372 INFO L225 Difference]: With dead ends: 1233 [2021-11-20 06:23:22,372 INFO L226 Difference]: Without dead ends: 709 [2021-11-20 06:23:22,374 INFO L932 BasicCegarLoop]: 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 [2021-11-20 06:23:22,375 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 206 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 06:23:22,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 488 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 06:23:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-11-20 06:23:22,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 606. [2021-11-20 06:23:22,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 469 states have (on average 1.2409381663113006) internal successors, (582), 472 states have internal predecessors, (582), 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) [2021-11-20 06:23:22,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 762 transitions. [2021-11-20 06:23:22,419 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 762 transitions. Word has length 51 [2021-11-20 06:23:22,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:22,420 INFO L470 AbstractCegarLoop]: Abstraction has 606 states and 762 transitions. [2021-11-20 06:23:22,420 INFO L471 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) [2021-11-20 06:23:22,420 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 762 transitions. [2021-11-20 06:23:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-20 06:23:22,423 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:22,423 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:23:22,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 06:23:22,424 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:22,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:22,424 INFO L85 PathProgramCache]: Analyzing trace with hash -38243739, now seen corresponding path program 1 times [2021-11-20 06:23:22,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:22,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953937409] [2021-11-20 06:23:22,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:22,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:22,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:22,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 06:23:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:22,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:22,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 06:23:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:22,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:22,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-20 06:23:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:22,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:22,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 06:23:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:22,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-20 06:23:22,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:22,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953937409] [2021-11-20 06:23:22,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953937409] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:23:22,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513663034] [2021-11-20 06:23:22,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:22,811 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:22,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:23:22,816 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:23:22,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 06:23:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:23,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-20 06:23:23,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:23:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-20 06:23:23,400 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:23:23,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513663034] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:23,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:23:23,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2021-11-20 06:23:23,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173762627] [2021-11-20 06:23:23,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:23,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 06:23:23,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:23,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 06:23:23,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-11-20 06:23:23,403 INFO L87 Difference]: Start difference. First operand 606 states and 762 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) [2021-11-20 06:23:23,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:23,475 INFO L93 Difference]: Finished difference Result 1189 states and 1524 transitions. [2021-11-20 06:23:23,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 06:23:23,475 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 [2021-11-20 06:23:23,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:23,480 INFO L225 Difference]: With dead ends: 1189 [2021-11-20 06:23:23,481 INFO L226 Difference]: Without dead ends: 596 [2021-11-20 06:23:23,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-11-20 06:23:23,484 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 41 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:23:23,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 677 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:23:23,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-11-20 06:23:23,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 426. [2021-11-20 06:23:23,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 331 states have (on average 1.2326283987915407) internal successors, (408), 334 states have internal predecessors, (408), 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) [2021-11-20 06:23:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 528 transitions. [2021-11-20 06:23:23,518 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 528 transitions. Word has length 86 [2021-11-20 06:23:23,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:23,519 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 528 transitions. [2021-11-20 06:23:23,519 INFO L471 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) [2021-11-20 06:23:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 528 transitions. [2021-11-20 06:23:23,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-20 06:23:23,521 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:23,522 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:23:23,558 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 06:23:23,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:23,744 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:23,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:23,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2068539649, now seen corresponding path program 1 times [2021-11-20 06:23:23,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:23,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727552628] [2021-11-20 06:23:23,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:23,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:23,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:23,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 06:23:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:24,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:24,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 06:23:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:24,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:24,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-20 06:23:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:24,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:24,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-20 06:23:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:24,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-11-20 06:23:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-20 06:23:24,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:24,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727552628] [2021-11-20 06:23:24,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727552628] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:23:24,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739660757] [2021-11-20 06:23:24,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:24,180 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:24,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:23:24,181 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:23:24,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 06:23:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:24,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-20 06:23:24,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:23:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-20 06:23:24,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:23:24,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739660757] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:24,688 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:23:24,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2021-11-20 06:23:24,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155855052] [2021-11-20 06:23:24,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:24,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 06:23:24,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:24,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 06:23:24,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2021-11-20 06:23:24,691 INFO L87 Difference]: Start difference. First operand 426 states and 528 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 7 states have internal predecessors, (55), 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) [2021-11-20 06:23:24,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:24,858 INFO L93 Difference]: Finished difference Result 906 states and 1163 transitions. [2021-11-20 06:23:24,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:23:24,864 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 7 states have internal predecessors, (55), 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 [2021-11-20 06:23:24,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:24,870 INFO L225 Difference]: With dead ends: 906 [2021-11-20 06:23:24,871 INFO L226 Difference]: Without dead ends: 596 [2021-11-20 06:23:24,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2021-11-20 06:23:24,877 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 185 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1776 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:23:24,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 1776 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:23:24,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-11-20 06:23:24,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 426. [2021-11-20 06:23:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 331 states have (on average 1.2265861027190332) internal successors, (406), 334 states have internal predecessors, (406), 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) [2021-11-20 06:23:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 526 transitions. [2021-11-20 06:23:24,923 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 526 transitions. Word has length 83 [2021-11-20 06:23:24,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:24,926 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 526 transitions. [2021-11-20 06:23:24,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 7 states have internal predecessors, (55), 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) [2021-11-20 06:23:24,926 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 526 transitions. [2021-11-20 06:23:24,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-20 06:23:24,929 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:24,929 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:23:24,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-20 06:23:25,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:25,145 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:25,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:25,146 INFO L85 PathProgramCache]: Analyzing trace with hash 23795875, now seen corresponding path program 1 times [2021-11-20 06:23:25,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:25,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064839576] [2021-11-20 06:23:25,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:25,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:25,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:25,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 06:23:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:25,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:25,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 06:23:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:25,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:25,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-20 06:23:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:25,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:25,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 06:23:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:25,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:25,493 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-20 06:23:25,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:25,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064839576] [2021-11-20 06:23:25,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064839576] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:23:25,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859251036] [2021-11-20 06:23:25,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:25,495 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:25,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:23:25,496 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:23:25,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-20 06:23:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:25,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 06:23:25,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:23:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-20 06:23:26,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:23:26,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859251036] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:26,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:23:26,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2021-11-20 06:23:26,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099989309] [2021-11-20 06:23:26,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:26,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 06:23:26,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:26,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 06:23:26,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-11-20 06:23:26,032 INFO L87 Difference]: Start difference. First operand 426 states and 526 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 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) [2021-11-20 06:23:26,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:26,218 INFO L93 Difference]: Finished difference Result 661 states and 817 transitions. [2021-11-20 06:23:26,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 06:23:26,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 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 [2021-11-20 06:23:26,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:26,226 INFO L225 Difference]: With dead ends: 661 [2021-11-20 06:23:26,226 INFO L226 Difference]: Without dead ends: 658 [2021-11-20 06:23:26,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-11-20 06:23:26,228 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 284 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 375 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.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:23:26,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 375 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:23:26,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2021-11-20 06:23:26,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 636. [2021-11-20 06:23:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 497 states have (on average 1.2374245472837022) internal successors, (615), 498 states have internal predecessors, (615), 88 states have call successors, (88), 51 states have call predecessors, (88), 50 states have return successors, (88), 86 states have call predecessors, (88), 84 states have call successors, (88) [2021-11-20 06:23:26,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 791 transitions. [2021-11-20 06:23:26,288 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 791 transitions. Word has length 86 [2021-11-20 06:23:26,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:26,289 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 791 transitions. [2021-11-20 06:23:26,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 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) [2021-11-20 06:23:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 791 transitions. [2021-11-20 06:23:26,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-11-20 06:23:26,291 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:26,291 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:23:26,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-20 06:23:26,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:26,514 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:26,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:26,515 INFO L85 PathProgramCache]: Analyzing trace with hash -170270410, now seen corresponding path program 1 times [2021-11-20 06:23:26,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:26,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257677402] [2021-11-20 06:23:26,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:26,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:26,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:26,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 06:23:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:26,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:26,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 06:23:26,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:26,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:26,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-20 06:23:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:26,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-20 06:23:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:26,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:26,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-11-20 06:23:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:26,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:26,721 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-20 06:23:26,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:26,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257677402] [2021-11-20 06:23:26,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257677402] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:26,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:23:26,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 06:23:26,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583662938] [2021-11-20 06:23:26,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:26,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-20 06:23:26,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:26,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-20 06:23:26,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-20 06:23:26,726 INFO L87 Difference]: Start difference. First operand 636 states and 791 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) [2021-11-20 06:23:27,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:27,113 INFO L93 Difference]: Finished difference Result 1320 states and 1645 transitions. [2021-11-20 06:23:27,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:23:27,114 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 [2021-11-20 06:23:27,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:27,119 INFO L225 Difference]: With dead ends: 1320 [2021-11-20 06:23:27,120 INFO L226 Difference]: Without dead ends: 685 [2021-11-20 06:23:27,122 INFO L932 BasicCegarLoop]: 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 [2021-11-20 06:23:27,123 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 163 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 06:23:27,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 647 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 06:23:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2021-11-20 06:23:27,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 596. [2021-11-20 06:23:27,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 465 states have (on average 1.2236559139784946) internal successors, (569), 466 states have internal predecessors, (569), 86 states have call successors, (86), 45 states have call predecessors, (86), 44 states have return successors, (88), 84 states have call predecessors, (88), 82 states have call successors, (88) [2021-11-20 06:23:27,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 743 transitions. [2021-11-20 06:23:27,178 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 743 transitions. Word has length 96 [2021-11-20 06:23:27,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:27,179 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 743 transitions. [2021-11-20 06:23:27,179 INFO L471 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) [2021-11-20 06:23:27,179 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 743 transitions. [2021-11-20 06:23:27,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-20 06:23:27,180 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:27,181 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:23:27,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 06:23:27,181 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:27,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:27,182 INFO L85 PathProgramCache]: Analyzing trace with hash 320363955, now seen corresponding path program 1 times [2021-11-20 06:23:27,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:27,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854839895] [2021-11-20 06:23:27,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:27,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:27,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:27,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 06:23:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:27,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:27,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 06:23:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:27,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:27,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-20 06:23:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:27,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:27,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 06:23:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:27,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:27,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-20 06:23:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:27,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-20 06:23:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:27,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-20 06:23:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-20 06:23:27,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:27,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854839895] [2021-11-20 06:23:27,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854839895] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:23:27,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436554348] [2021-11-20 06:23:27,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:27,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:27,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:23:27,488 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:23:27,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-20 06:23:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:27,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-20 06:23:27,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:23:28,736 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0))) (exists ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)))) is different from true [2021-11-20 06:23:28,986 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-20 06:23:28,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2021-11-20 06:23:28,999 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-11-20 06:23:28,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2021-11-20 06:23:29,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-11-20 06:23:29,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-11-20 06:23:29,191 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-20 06:23:29,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:23:29,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436554348] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:29,192 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:23:29,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2021-11-20 06:23:29,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333274005] [2021-11-20 06:23:29,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:29,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 06:23:29,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:29,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 06:23:29,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=241, Unknown=1, NotChecked=30, Total=306 [2021-11-20 06:23:29,194 INFO L87 Difference]: Start difference. First operand 596 states and 743 transitions. Second operand has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-11-20 06:23:30,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:30,004 INFO L93 Difference]: Finished difference Result 702 states and 868 transitions. [2021-11-20 06:23:30,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 06:23:30,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 105 [2021-11-20 06:23:30,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:30,010 INFO L225 Difference]: With dead ends: 702 [2021-11-20 06:23:30,011 INFO L226 Difference]: Without dead ends: 661 [2021-11-20 06:23:30,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=303, Unknown=1, NotChecked=34, Total=380 [2021-11-20 06:23:30,012 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 24 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 06:23:30,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 1066 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 238 Unchecked, 0.7s Time] [2021-11-20 06:23:30,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2021-11-20 06:23:30,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 628. [2021-11-20 06:23:30,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 487 states have (on average 1.2258726899383983) internal successors, (597), 490 states have internal predecessors, (597), 90 states have call successors, (90), 49 states have call predecessors, (90), 50 states have return successors, (98), 88 states have call predecessors, (98), 86 states have call successors, (98) [2021-11-20 06:23:30,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 785 transitions. [2021-11-20 06:23:30,065 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 785 transitions. Word has length 105 [2021-11-20 06:23:30,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:30,066 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 785 transitions. [2021-11-20 06:23:30,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-11-20 06:23:30,066 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 785 transitions. [2021-11-20 06:23:30,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-11-20 06:23:30,068 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:30,068 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:23:30,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-20 06:23:30,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-11-20 06:23:30,281 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:30,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:30,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1953167954, now seen corresponding path program 1 times [2021-11-20 06:23:30,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:30,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516792122] [2021-11-20 06:23:30,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:30,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:30,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:30,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 06:23:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:30,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:30,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 06:23:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:30,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:30,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-20 06:23:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:30,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:30,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 06:23:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:30,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:30,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-20 06:23:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:30,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-20 06:23:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:30,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-20 06:23:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:30,618 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-20 06:23:30,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:30,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516792122] [2021-11-20 06:23:30,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516792122] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:23:30,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988140161] [2021-11-20 06:23:30,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:30,620 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:30,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:23:30,621 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:23:30,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-20 06:23:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:30,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-20 06:23:30,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:23:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-20 06:23:31,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:23:31,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988140161] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:31,221 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:23:31,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2021-11-20 06:23:31,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252639977] [2021-11-20 06:23:31,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:31,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 06:23:31,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:31,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 06:23:31,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2021-11-20 06:23:31,223 INFO L87 Difference]: Start difference. First operand 628 states and 785 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-20 06:23:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:31,445 INFO L93 Difference]: Finished difference Result 1390 states and 1777 transitions. [2021-11-20 06:23:31,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:23:31,446 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), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2021-11-20 06:23:31,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:31,452 INFO L225 Difference]: With dead ends: 1390 [2021-11-20 06:23:31,453 INFO L226 Difference]: Without dead ends: 810 [2021-11-20 06:23:31,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2021-11-20 06:23:31,456 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 145 mSDsluCounter, 1869 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 2164 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:23:31,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 2164 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:23:31,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2021-11-20 06:23:31,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 628. [2021-11-20 06:23:31,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 485 states have (on average 1.2185567010309277) internal successors, (591), 491 states have internal predecessors, (591), 88 states have call successors, (88), 49 states have call predecessors, (88), 54 states have return successors, (102), 87 states have call predecessors, (102), 84 states have call successors, (102) [2021-11-20 06:23:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 781 transitions. [2021-11-20 06:23:31,522 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 781 transitions. Word has length 105 [2021-11-20 06:23:31,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:31,523 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 781 transitions. [2021-11-20 06:23:31,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-20 06:23:31,524 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 781 transitions. [2021-11-20 06:23:31,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-20 06:23:31,529 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:31,529 INFO L514 BasicCegarLoop]: 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, 1, 1] [2021-11-20 06:23:31,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-20 06:23:31,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-20 06:23:31,745 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:31,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:31,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1044819566, now seen corresponding path program 1 times [2021-11-20 06:23:31,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:31,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546785772] [2021-11-20 06:23:31,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:31,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:31,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:31,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 06:23:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:31,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:32,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 06:23:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:32,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:32,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-20 06:23:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:32,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:32,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 06:23:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:32,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:32,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-20 06:23:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:32,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 06:23:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:32,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-20 06:23:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:32,097 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-20 06:23:32,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:32,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546785772] [2021-11-20 06:23:32,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546785772] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:23:32,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494239952] [2021-11-20 06:23:32,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:32,099 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:32,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:23:32,100 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:23:32,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-20 06:23:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:32,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 39 conjunts are in the unsatisfiable core [2021-11-20 06:23:32,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:23:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-20 06:23:32,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:23:32,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494239952] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:32,856 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:23:32,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 18 [2021-11-20 06:23:32,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781912707] [2021-11-20 06:23:32,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:32,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 06:23:32,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:32,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 06:23:32,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2021-11-20 06:23:32,862 INFO L87 Difference]: Start difference. First operand 628 states and 781 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-20 06:23:33,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:33,051 INFO L93 Difference]: Finished difference Result 1262 states and 1579 transitions. [2021-11-20 06:23:33,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:23:33,052 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2021-11-20 06:23:33,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:33,057 INFO L225 Difference]: With dead ends: 1262 [2021-11-20 06:23:33,058 INFO L226 Difference]: Without dead ends: 677 [2021-11-20 06:23:33,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2021-11-20 06:23:33,060 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 23 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:23:33,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 1541 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:23:33,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2021-11-20 06:23:33,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 648. [2021-11-20 06:23:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 500 states have (on average 1.212) internal successors, (606), 505 states have internal predecessors, (606), 88 states have call successors, (88), 49 states have call predecessors, (88), 59 states have return successors, (111), 93 states have call predecessors, (111), 84 states have call successors, (111) [2021-11-20 06:23:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 805 transitions. [2021-11-20 06:23:33,114 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 805 transitions. Word has length 107 [2021-11-20 06:23:33,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:33,114 INFO L470 AbstractCegarLoop]: Abstraction has 648 states and 805 transitions. [2021-11-20 06:23:33,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-20 06:23:33,115 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 805 transitions. [2021-11-20 06:23:33,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-11-20 06:23:33,116 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:33,117 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:23:33,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-20 06:23:33,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-11-20 06:23:33,333 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:33,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:33,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1482829069, now seen corresponding path program 1 times [2021-11-20 06:23:33,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:33,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188685654] [2021-11-20 06:23:33,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:33,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:33,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:33,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 06:23:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:33,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:33,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 06:23:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:33,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:33,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-20 06:23:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:33,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:33,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 06:23:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:33,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:33,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-20 06:23:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:33,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 06:23:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:33,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-20 06:23:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:33,607 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-20 06:23:33,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:33,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188685654] [2021-11-20 06:23:33,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188685654] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:23:33,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821292603] [2021-11-20 06:23:33,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:33,608 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:33,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:23:33,610 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:23:33,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-20 06:23:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:33,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-20 06:23:33,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:23:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-11-20 06:23:34,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:23:34,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821292603] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:34,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:23:34,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 14 [2021-11-20 06:23:34,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596490232] [2021-11-20 06:23:34,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:34,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 06:23:34,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:34,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 06:23:34,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-11-20 06:23:34,093 INFO L87 Difference]: Start difference. First operand 648 states and 805 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-20 06:23:34,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:34,183 INFO L93 Difference]: Finished difference Result 854 states and 1086 transitions. [2021-11-20 06:23:34,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 06:23:34,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 107 [2021-11-20 06:23:34,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:34,191 INFO L225 Difference]: With dead ends: 854 [2021-11-20 06:23:34,191 INFO L226 Difference]: Without dead ends: 819 [2021-11-20 06:23:34,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-11-20 06:23:34,193 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 72 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 727 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 [2021-11-20 06:23:34,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 727 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:23:34,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2021-11-20 06:23:34,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 648. [2021-11-20 06:23:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 500 states have (on average 1.212) internal successors, (606), 505 states have internal predecessors, (606), 88 states have call successors, (88), 49 states have call predecessors, (88), 59 states have return successors, (111), 93 states have call predecessors, (111), 84 states have call successors, (111) [2021-11-20 06:23:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 805 transitions. [2021-11-20 06:23:34,248 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 805 transitions. Word has length 107 [2021-11-20 06:23:34,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:34,249 INFO L470 AbstractCegarLoop]: Abstraction has 648 states and 805 transitions. [2021-11-20 06:23:34,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-11-20 06:23:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 805 transitions. [2021-11-20 06:23:34,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-20 06:23:34,251 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:34,251 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:23:34,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-20 06:23:34,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-20 06:23:34,468 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:34,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:34,469 INFO L85 PathProgramCache]: Analyzing trace with hash 966922471, now seen corresponding path program 1 times [2021-11-20 06:23:34,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:34,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309330203] [2021-11-20 06:23:34,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:34,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:34,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:34,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 06:23:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:34,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:34,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 06:23:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:34,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:34,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-20 06:23:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:34,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:34,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 06:23:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:34,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:34,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-11-20 06:23:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:34,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-11-20 06:23:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:34,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-11-20 06:23:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-20 06:23:34,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:34,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309330203] [2021-11-20 06:23:34,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309330203] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:23:34,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312174627] [2021-11-20 06:23:34,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:34,830 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:34,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:23:34,831 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:23:34,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-20 06:23:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:35,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-20 06:23:35,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:23:35,433 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-11-20 06:23:35,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:23:35,814 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-11-20 06:23:35,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312174627] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 06:23:35,814 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:23:35,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12, 5] total 17 [2021-11-20 06:23:35,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767350294] [2021-11-20 06:23:35,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:35,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:23:35,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:35,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:23:35,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-11-20 06:23:35,817 INFO L87 Difference]: Start difference. First operand 648 states and 805 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-20 06:23:36,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:36,398 INFO L93 Difference]: Finished difference Result 1874 states and 2335 transitions. [2021-11-20 06:23:36,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-20 06:23:36,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 108 [2021-11-20 06:23:36,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:36,407 INFO L225 Difference]: With dead ends: 1874 [2021-11-20 06:23:36,407 INFO L226 Difference]: Without dead ends: 1250 [2021-11-20 06:23:36,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-11-20 06:23:36,411 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 536 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 06:23:36,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [544 Valid, 486 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 06:23:36,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2021-11-20 06:23:36,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1210. [2021-11-20 06:23:36,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 935 states have (on average 1.2117647058823529) internal successors, (1133), 943 states have internal predecessors, (1133), 163 states have call successors, (163), 92 states have call predecessors, (163), 111 states have return successors, (208), 174 states have call predecessors, (208), 159 states have call successors, (208) [2021-11-20 06:23:36,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1504 transitions. [2021-11-20 06:23:36,528 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1504 transitions. Word has length 108 [2021-11-20 06:23:36,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:36,529 INFO L470 AbstractCegarLoop]: Abstraction has 1210 states and 1504 transitions. [2021-11-20 06:23:36,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-11-20 06:23:36,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1504 transitions. [2021-11-20 06:23:36,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-20 06:23:36,532 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:36,532 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:23:36,572 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-20 06:23:36,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-11-20 06:23:36,733 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:36,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:36,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1819211607, now seen corresponding path program 1 times [2021-11-20 06:23:36,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:36,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821208493] [2021-11-20 06:23:36,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:36,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:36,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:36,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 06:23:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:36,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:36,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 06:23:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:36,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:36,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-20 06:23:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:36,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:36,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 06:23:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:37,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:37,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-20 06:23:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:37,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-20 06:23:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:37,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-20 06:23:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:37,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-20 06:23:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:37,025 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-20 06:23:37,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:37,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821208493] [2021-11-20 06:23:37,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821208493] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:23:37,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373761527] [2021-11-20 06:23:37,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:37,027 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:37,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:23:37,029 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:23:37,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-20 06:23:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:37,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 1150 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-20 06:23:37,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:23:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-20 06:23:37,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:23:37,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373761527] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:37,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:23:37,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2021-11-20 06:23:37,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377672027] [2021-11-20 06:23:37,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:37,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 06:23:37,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:37,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 06:23:37,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-11-20 06:23:37,570 INFO L87 Difference]: Start difference. First operand 1210 states and 1504 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-20 06:23:37,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:37,664 INFO L93 Difference]: Finished difference Result 1861 states and 2314 transitions. [2021-11-20 06:23:37,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 06:23:37,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2021-11-20 06:23:37,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:37,671 INFO L225 Difference]: With dead ends: 1861 [2021-11-20 06:23:37,671 INFO L226 Difference]: Without dead ends: 697 [2021-11-20 06:23:37,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-11-20 06:23:37,676 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 13 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:23:37,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 589 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:23:37,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2021-11-20 06:23:37,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 667. [2021-11-20 06:23:37,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 515 states have (on average 1.2058252427184466) internal successors, (621), 520 states have internal predecessors, (621), 90 states have call successors, (90), 51 states have call predecessors, (90), 61 states have return successors, (112), 95 states have call predecessors, (112), 86 states have call successors, (112) [2021-11-20 06:23:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 823 transitions. [2021-11-20 06:23:37,737 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 823 transitions. Word has length 116 [2021-11-20 06:23:37,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:37,737 INFO L470 AbstractCegarLoop]: Abstraction has 667 states and 823 transitions. [2021-11-20 06:23:37,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-20 06:23:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 823 transitions. [2021-11-20 06:23:37,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-11-20 06:23:37,739 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:37,739 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:23:37,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-20 06:23:37,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:37,954 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:37,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:37,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2067358101, now seen corresponding path program 1 times [2021-11-20 06:23:37,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:37,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211301198] [2021-11-20 06:23:37,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:37,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:38,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:38,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 06:23:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:38,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:38,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 06:23:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:38,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:38,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-20 06:23:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:38,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:38,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 06:23:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:38,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:38,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-20 06:23:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:38,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-20 06:23:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:38,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-20 06:23:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:38,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-20 06:23:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-20 06:23:38,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:38,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211301198] [2021-11-20 06:23:38,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211301198] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:23:38,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60156369] [2021-11-20 06:23:38,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:38,309 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:38,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:23:38,313 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:23:38,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-20 06:23:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:38,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 1149 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 06:23:38,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:23:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-20 06:23:38,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:23:38,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60156369] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:38,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:23:38,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2021-11-20 06:23:38,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063998087] [2021-11-20 06:23:38,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:38,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 06:23:38,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:38,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 06:23:38,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-11-20 06:23:38,974 INFO L87 Difference]: Start difference. First operand 667 states and 823 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-20 06:23:39,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:39,213 INFO L93 Difference]: Finished difference Result 1213 states and 1506 transitions. [2021-11-20 06:23:39,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 06:23:39,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2021-11-20 06:23:39,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:39,224 INFO L225 Difference]: With dead ends: 1213 [2021-11-20 06:23:39,224 INFO L226 Difference]: Without dead ends: 1208 [2021-11-20 06:23:39,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-11-20 06:23:39,226 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 309 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:23:39,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 339 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 06:23:39,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2021-11-20 06:23:39,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1176. [2021-11-20 06:23:39,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 910 states have (on average 1.2142857142857142) internal successors, (1105), 917 states have internal predecessors, (1105), 154 states have call successors, (154), 91 states have call predecessors, (154), 111 states have return successors, (207), 167 states have call predecessors, (207), 150 states have call successors, (207) [2021-11-20 06:23:39,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1466 transitions. [2021-11-20 06:23:39,355 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1466 transitions. Word has length 116 [2021-11-20 06:23:39,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:39,356 INFO L470 AbstractCegarLoop]: Abstraction has 1176 states and 1466 transitions. [2021-11-20 06:23:39,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-20 06:23:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1466 transitions. [2021-11-20 06:23:39,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-11-20 06:23:39,359 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:39,359 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:23:39,402 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-20 06:23:39,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-20 06:23:39,579 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:39,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:39,580 INFO L85 PathProgramCache]: Analyzing trace with hash 541721343, now seen corresponding path program 1 times [2021-11-20 06:23:39,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:39,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399362714] [2021-11-20 06:23:39,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:39,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:39,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:39,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 06:23:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:39,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:39,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 06:23:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:39,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:39,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-20 06:23:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:39,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:39,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 06:23:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:39,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:39,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-20 06:23:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:39,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-20 06:23:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:39,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-20 06:23:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:39,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-20 06:23:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:39,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-20 06:23:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:39,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:39,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-11-20 06:23:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-20 06:23:39,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:39,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399362714] [2021-11-20 06:23:39,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399362714] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:23:39,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478205536] [2021-11-20 06:23:39,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:39,914 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:39,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:23:39,915 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:23:39,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-20 06:23:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:40,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 1205 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 06:23:40,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:23:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-20 06:23:40,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:23:40,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478205536] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:40,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:23:40,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2021-11-20 06:23:40,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482969009] [2021-11-20 06:23:40,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:40,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 06:23:40,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:40,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 06:23:40,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-11-20 06:23:40,527 INFO L87 Difference]: Start difference. First operand 1176 states and 1466 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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) [2021-11-20 06:23:40,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:40,764 INFO L93 Difference]: Finished difference Result 1368 states and 1732 transitions. [2021-11-20 06:23:40,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 06:23:40,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 129 [2021-11-20 06:23:40,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:40,774 INFO L225 Difference]: With dead ends: 1368 [2021-11-20 06:23:40,774 INFO L226 Difference]: Without dead ends: 1358 [2021-11-20 06:23:40,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-11-20 06:23:40,776 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 213 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 446 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.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:23:40,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 446 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:23:40,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2021-11-20 06:23:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1182. [2021-11-20 06:23:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 916 states have (on average 1.212882096069869) internal successors, (1111), 923 states have internal predecessors, (1111), 154 states have call successors, (154), 91 states have call predecessors, (154), 111 states have return successors, (207), 167 states have call predecessors, (207), 150 states have call successors, (207) [2021-11-20 06:23:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1472 transitions. [2021-11-20 06:23:40,900 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1472 transitions. Word has length 129 [2021-11-20 06:23:40,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:40,901 INFO L470 AbstractCegarLoop]: Abstraction has 1182 states and 1472 transitions. [2021-11-20 06:23:40,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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) [2021-11-20 06:23:40,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1472 transitions. [2021-11-20 06:23:40,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-11-20 06:23:40,905 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:40,905 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2021-11-20 06:23:40,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-20 06:23:41,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:41,123 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:41,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:41,123 INFO L85 PathProgramCache]: Analyzing trace with hash -554191626, now seen corresponding path program 1 times [2021-11-20 06:23:41,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:41,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743583071] [2021-11-20 06:23:41,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:41,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:41,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:41,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 06:23:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:41,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:41,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 06:23:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:41,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:41,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-20 06:23:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:41,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:41,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 06:23:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:41,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:41,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-20 06:23:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:41,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-20 06:23:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:41,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-20 06:23:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:41,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-20 06:23:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:41,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-11-20 06:23:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:41,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:41,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-11-20 06:23:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:41,428 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-20 06:23:41,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:41,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743583071] [2021-11-20 06:23:41,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743583071] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:23:41,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978957887] [2021-11-20 06:23:41,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:41,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:41,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:23:41,431 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:23:41,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-20 06:23:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:41,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-20 06:23:41,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:23:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-11-20 06:23:42,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:23:42,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978957887] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:42,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:23:42,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2021-11-20 06:23:42,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383715230] [2021-11-20 06:23:42,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:42,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 06:23:42,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:42,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 06:23:42,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-11-20 06:23:42,122 INFO L87 Difference]: Start difference. First operand 1182 states and 1472 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) [2021-11-20 06:23:42,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:42,260 INFO L93 Difference]: Finished difference Result 2302 states and 2876 transitions. [2021-11-20 06:23:42,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 06:23:42,261 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 133 [2021-11-20 06:23:42,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:42,269 INFO L225 Difference]: With dead ends: 2302 [2021-11-20 06:23:42,269 INFO L226 Difference]: Without dead ends: 1110 [2021-11-20 06:23:42,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-11-20 06:23:42,274 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 55 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:23:42,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 337 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:23:42,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2021-11-20 06:23:42,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2021-11-20 06:23:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 844 states have (on average 1.15521327014218) internal successors, (975), 851 states have internal predecessors, (975), 154 states have call successors, (154), 91 states have call predecessors, (154), 111 states have return successors, (207), 167 states have call predecessors, (207), 150 states have call successors, (207) [2021-11-20 06:23:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1336 transitions. [2021-11-20 06:23:42,367 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1336 transitions. Word has length 133 [2021-11-20 06:23:42,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:42,367 INFO L470 AbstractCegarLoop]: Abstraction has 1110 states and 1336 transitions. [2021-11-20 06:23:42,367 INFO L471 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) [2021-11-20 06:23:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1336 transitions. [2021-11-20 06:23:42,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-20 06:23:42,370 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:42,370 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:23:42,409 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-20 06:23:42,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-20 06:23:42,587 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:42,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:42,588 INFO L85 PathProgramCache]: Analyzing trace with hash 78838695, now seen corresponding path program 1 times [2021-11-20 06:23:42,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:42,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913082694] [2021-11-20 06:23:42,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:42,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:42,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:42,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 06:23:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:42,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:42,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 06:23:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:42,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:42,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-20 06:23:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:42,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:42,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 06:23:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:42,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:42,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-20 06:23:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:42,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-20 06:23:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:42,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-20 06:23:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:42,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-20 06:23:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:42,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-20 06:23:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:43,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-20 06:23:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:43,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-20 06:23:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:43,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-20 06:23:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-20 06:23:43,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:43,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913082694] [2021-11-20 06:23:43,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913082694] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:23:43,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100314777] [2021-11-20 06:23:43,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:43,034 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:43,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:23:43,040 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:23:43,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-20 06:23:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:43,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 1247 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-20 06:23:43,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:23:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-11-20 06:23:43,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:23:43,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100314777] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:43,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:23:43,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2021-11-20 06:23:43,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21506302] [2021-11-20 06:23:43,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:43,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 06:23:43,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:43,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 06:23:43,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2021-11-20 06:23:43,987 INFO L87 Difference]: Start difference. First operand 1110 states and 1336 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 7 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-20 06:23:44,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:44,214 INFO L93 Difference]: Finished difference Result 2194 states and 2647 transitions. [2021-11-20 06:23:44,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:23:44,215 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 7 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2021-11-20 06:23:44,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:44,224 INFO L225 Difference]: With dead ends: 2194 [2021-11-20 06:23:44,225 INFO L226 Difference]: Without dead ends: 1139 [2021-11-20 06:23:44,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2021-11-20 06:23:44,229 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 27 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1595 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:23:44,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 1595 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:23:44,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2021-11-20 06:23:44,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1110. [2021-11-20 06:23:44,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 844 states have (on average 1.1492890995260663) internal successors, (970), 851 states have internal predecessors, (970), 154 states have call successors, (154), 91 states have call predecessors, (154), 111 states have return successors, (207), 167 states have call predecessors, (207), 150 states have call successors, (207) [2021-11-20 06:23:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1331 transitions. [2021-11-20 06:23:44,333 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1331 transitions. Word has length 144 [2021-11-20 06:23:44,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:44,334 INFO L470 AbstractCegarLoop]: Abstraction has 1110 states and 1331 transitions. [2021-11-20 06:23:44,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 7 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-20 06:23:44,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1331 transitions. [2021-11-20 06:23:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-11-20 06:23:44,337 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:44,337 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:23:44,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-20 06:23:44,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-20 06:23:44,553 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:44,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:44,553 INFO L85 PathProgramCache]: Analyzing trace with hash 92371496, now seen corresponding path program 2 times [2021-11-20 06:23:44,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:44,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686400084] [2021-11-20 06:23:44,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:44,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:44,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:44,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 06:23:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:44,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:44,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 06:23:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:44,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:44,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-20 06:23:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:44,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:44,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 06:23:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:44,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:44,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-20 06:23:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:44,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-20 06:23:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:44,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-20 06:23:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:44,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-20 06:23:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:44,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-20 06:23:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:44,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-11-20 06:23:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:44,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-11-20 06:23:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:44,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-11-20 06:23:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:44,940 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-20 06:23:44,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:44,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686400084] [2021-11-20 06:23:44,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686400084] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:23:44,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945846340] [2021-11-20 06:23:44,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:23:44,943 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:44,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:23:44,949 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:23:44,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-20 06:23:45,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-20 06:23:45,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:23:45,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 06:23:45,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:23:45,713 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-20 06:23:45,713 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:23:45,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945846340] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:45,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:23:45,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2021-11-20 06:23:45,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358968156] [2021-11-20 06:23:45,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:45,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 06:23:45,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:45,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 06:23:45,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-11-20 06:23:45,716 INFO L87 Difference]: Start difference. First operand 1110 states and 1331 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-20 06:23:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:45,805 INFO L93 Difference]: Finished difference Result 1765 states and 2122 transitions. [2021-11-20 06:23:45,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 06:23:45,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 144 [2021-11-20 06:23:45,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:45,812 INFO L225 Difference]: With dead ends: 1765 [2021-11-20 06:23:45,813 INFO L226 Difference]: Without dead ends: 717 [2021-11-20 06:23:45,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-11-20 06:23:45,817 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 5 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:23:45,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 360 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:23:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-11-20 06:23:45,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 713. [2021-11-20 06:23:45,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 543 states have (on average 1.138121546961326) internal successors, (618), 548 states have internal predecessors, (618), 100 states have call successors, (100), 61 states have call predecessors, (100), 69 states have return successors, (122), 103 states have call predecessors, (122), 96 states have call successors, (122) [2021-11-20 06:23:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 840 transitions. [2021-11-20 06:23:45,907 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 840 transitions. Word has length 144 [2021-11-20 06:23:45,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:45,908 INFO L470 AbstractCegarLoop]: Abstraction has 713 states and 840 transitions. [2021-11-20 06:23:45,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-20 06:23:45,909 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 840 transitions. [2021-11-20 06:23:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-11-20 06:23:45,911 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:45,912 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:23:45,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-20 06:23:46,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:46,141 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:46,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:46,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1279560877, now seen corresponding path program 1 times [2021-11-20 06:23:46,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:46,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502331038] [2021-11-20 06:23:46,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:46,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:46,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:46,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 06:23:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:46,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:46,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 06:23:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:46,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:46,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-20 06:23:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:46,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:46,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 06:23:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:46,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:46,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-20 06:23:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:46,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-20 06:23:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:46,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-20 06:23:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:46,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-20 06:23:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:46,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-20 06:23:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:46,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-20 06:23:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:46,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-20 06:23:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:46,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-20 06:23:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:46,557 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-20 06:23:46,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:46,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502331038] [2021-11-20 06:23:46,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502331038] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:23:46,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007566294] [2021-11-20 06:23:46,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:46,559 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:46,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:23:46,561 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:23:46,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-20 06:23:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:46,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 1252 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-20 06:23:46,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:23:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-20 06:23:47,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:23:47,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007566294] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:47,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:23:47,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2021-11-20 06:23:47,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600496063] [2021-11-20 06:23:47,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:47,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:23:47,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:47,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:23:47,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-11-20 06:23:47,399 INFO L87 Difference]: Start difference. First operand 713 states and 840 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-20 06:23:47,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:47,903 INFO L93 Difference]: Finished difference Result 1338 states and 1585 transitions. [2021-11-20 06:23:47,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:23:47,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 146 [2021-11-20 06:23:47,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:47,910 INFO L225 Difference]: With dead ends: 1338 [2021-11-20 06:23:47,910 INFO L226 Difference]: Without dead ends: 653 [2021-11-20 06:23:47,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-11-20 06:23:47,914 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 149 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 06:23:47,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 511 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 06:23:47,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2021-11-20 06:23:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 596. [2021-11-20 06:23:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 456 states have (on average 1.1337719298245614) internal successors, (517), 461 states have internal predecessors, (517), 84 states have call successors, (84), 49 states have call predecessors, (84), 55 states have return successors, (102), 85 states have call predecessors, (102), 81 states have call successors, (102) [2021-11-20 06:23:47,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 703 transitions. [2021-11-20 06:23:47,983 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 703 transitions. Word has length 146 [2021-11-20 06:23:47,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:47,985 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 703 transitions. [2021-11-20 06:23:47,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-20 06:23:47,986 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 703 transitions. [2021-11-20 06:23:47,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-11-20 06:23:47,988 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:47,989 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:23:48,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-20 06:23:48,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:48,204 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:48,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:48,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1011559813, now seen corresponding path program 1 times [2021-11-20 06:23:48,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:48,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086231075] [2021-11-20 06:23:48,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:48,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:48,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:48,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 06:23:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:48,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:48,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 06:23:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:48,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:48,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-20 06:23:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:48,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:48,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 06:23:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:48,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:48,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-20 06:23:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:48,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-20 06:23:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:48,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-20 06:23:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:48,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-20 06:23:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:48,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-20 06:23:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:48,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-20 06:23:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:48,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-20 06:23:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:48,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-20 06:23:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-20 06:23:48,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:48,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086231075] [2021-11-20 06:23:48,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086231075] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:23:48,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012453204] [2021-11-20 06:23:48,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:48,626 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:48,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:23:48,627 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:23:48,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-20 06:23:48,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:48,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-20 06:23:48,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:23:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-20 06:23:49,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:23:49,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012453204] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:49,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:23:49,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 16 [2021-11-20 06:23:49,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952339587] [2021-11-20 06:23:49,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:49,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 06:23:49,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:49,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 06:23:49,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-11-20 06:23:49,479 INFO L87 Difference]: Start difference. First operand 596 states and 703 transitions. Second operand has 10 states, 10 states have (on average 10.1) internal successors, (101), 8 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-20 06:23:49,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:49,755 INFO L93 Difference]: Finished difference Result 1241 states and 1469 transitions. [2021-11-20 06:23:49,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 06:23:49,755 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.1) internal successors, (101), 8 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2021-11-20 06:23:49,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:49,761 INFO L225 Difference]: With dead ends: 1241 [2021-11-20 06:23:49,762 INFO L226 Difference]: Without dead ends: 673 [2021-11-20 06:23:49,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-11-20 06:23:49,765 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 35 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:23:49,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 1743 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:23:49,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2021-11-20 06:23:49,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 633. [2021-11-20 06:23:49,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 488 states have (on average 1.1311475409836065) internal successors, (552), 490 states have internal predecessors, (552), 84 states have call successors, (84), 49 states have call predecessors, (84), 60 states have return successors, (110), 93 states have call predecessors, (110), 81 states have call successors, (110) [2021-11-20 06:23:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 746 transitions. [2021-11-20 06:23:49,832 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 746 transitions. Word has length 147 [2021-11-20 06:23:49,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:49,832 INFO L470 AbstractCegarLoop]: Abstraction has 633 states and 746 transitions. [2021-11-20 06:23:49,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.1) internal successors, (101), 8 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2021-11-20 06:23:49,833 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 746 transitions. [2021-11-20 06:23:49,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-11-20 06:23:49,835 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:49,835 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:23:49,881 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-20 06:23:50,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:50,057 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:50,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:50,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2093368100, now seen corresponding path program 2 times [2021-11-20 06:23:50,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:50,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499613071] [2021-11-20 06:23:50,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:50,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:50,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:50,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 06:23:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:50,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:50,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 06:23:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:50,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:50,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-20 06:23:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:50,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:50,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 06:23:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:50,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:50,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-20 06:23:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:50,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-20 06:23:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:50,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-20 06:23:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:50,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-20 06:23:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:50,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-20 06:23:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:50,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-20 06:23:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:50,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-11-20 06:23:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:50,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-11-20 06:23:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-11-20 06:23:50,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:50,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499613071] [2021-11-20 06:23:50,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499613071] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:23:50,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606937101] [2021-11-20 06:23:50,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:23:50,417 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:50,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:23:50,419 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:23:50,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-20 06:23:50,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-20 06:23:50,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:23:50,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 06:23:50,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:23:51,034 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-20 06:23:51,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:23:51,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606937101] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:51,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:23:51,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2021-11-20 06:23:51,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516465034] [2021-11-20 06:23:51,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:51,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 06:23:51,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:51,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 06:23:51,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-11-20 06:23:51,038 INFO L87 Difference]: Start difference. First operand 633 states and 746 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-20 06:23:51,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:51,066 INFO L93 Difference]: Finished difference Result 660 states and 770 transitions. [2021-11-20 06:23:51,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 06:23:51,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 147 [2021-11-20 06:23:51,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:51,070 INFO L225 Difference]: With dead ends: 660 [2021-11-20 06:23:51,070 INFO L226 Difference]: Without dead ends: 259 [2021-11-20 06:23:51,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-11-20 06:23:51,072 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 4 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:23:51,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 317 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:23:51,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-11-20 06:23:51,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 245. [2021-11-20 06:23:51,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 186 states have (on average 1.0913978494623655) internal successors, (203), 189 states have internal predecessors, (203), 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) [2021-11-20 06:23:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 274 transitions. [2021-11-20 06:23:51,096 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 274 transitions. Word has length 147 [2021-11-20 06:23:51,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:51,097 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 274 transitions. [2021-11-20 06:23:51,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-20 06:23:51,097 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2021-11-20 06:23:51,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-11-20 06:23:51,100 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:23:51,100 INFO L514 BasicCegarLoop]: 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] [2021-11-20 06:23:51,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-20 06:23:51,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-20 06:23:51,325 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:23:51,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:23:51,325 INFO L85 PathProgramCache]: Analyzing trace with hash 301053376, now seen corresponding path program 1 times [2021-11-20 06:23:51,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:23:51,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105489310] [2021-11-20 06:23:51,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:51,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:23:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:51,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-20 06:23:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:51,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-20 06:23:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:51,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:51,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-11-20 06:23:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:51,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:51,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-20 06:23:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:51,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:51,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-11-20 06:23:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:51,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-20 06:23:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:51,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-11-20 06:23:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:51,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-11-20 06:23:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:51,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-11-20 06:23:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:51,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-11-20 06:23:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:51,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-11-20 06:23:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:51,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-11-20 06:23:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:51,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-11-20 06:23:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:51,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-11-20 06:23:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:51,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:51,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-11-20 06:23:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:51,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-20 06:23:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-11-20 06:23:51,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:23:51,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105489310] [2021-11-20 06:23:51,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105489310] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:23:51,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838168735] [2021-11-20 06:23:51,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:23:51,681 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:51,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:23:51,685 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:23:51,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-20 06:23:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:23:52,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 1409 conjuncts, 11 conjunts are in the unsatisfiable core [2021-11-20 06:23:52,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:23:52,435 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-11-20 06:23:52,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:23:52,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838168735] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:23:52,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:23:52,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2021-11-20 06:23:52,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863058070] [2021-11-20 06:23:52,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:23:52,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:23:52,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:23:52,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:23:52,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-11-20 06:23:52,442 INFO L87 Difference]: Start difference. First operand 245 states and 274 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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) [2021-11-20 06:23:52,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:23:52,544 INFO L93 Difference]: Finished difference Result 251 states and 279 transitions. [2021-11-20 06:23:52,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:23:52,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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 177 [2021-11-20 06:23:52,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:23:52,545 INFO L225 Difference]: With dead ends: 251 [2021-11-20 06:23:52,545 INFO L226 Difference]: Without dead ends: 0 [2021-11-20 06:23:52,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-11-20 06:23:52,546 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 36 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 572 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.1s IncrementalHoareTripleChecker+Time [2021-11-20 06:23:52,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 572 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 06:23:52,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-20 06:23:52,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-20 06:23:52,547 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) [2021-11-20 06:23:52,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-20 06:23:52,548 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 177 [2021-11-20 06:23:52,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:23:52,548 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-20 06:23:52,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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) [2021-11-20 06:23:52,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-20 06:23:52,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-20 06:23:52,551 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-20 06:23:52,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-20 06:23:52,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:23:52,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-20 06:24:05,962 WARN L227 SmtUtils]: Spent 10.25s on a formula simplification. DAG size of input: 135 DAG size of output: 131 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-20 06:24:17,380 WARN L227 SmtUtils]: Spent 9.33s on a formula simplification. DAG size of input: 135 DAG size of output: 131 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-20 06:24:31,906 INFO L861 garLoopResultBuilder]: At program point L4257(lines 4256 4258) the Hoare annotation is: true [2021-11-20 06:24:31,906 INFO L858 garLoopResultBuilder]: For program point kbtab_initEXIT(lines 3909 3925) no Hoare annotation was computed. [2021-11-20 06:24:31,906 INFO L861 garLoopResultBuilder]: At program point L3922(lines 3911 3924) the Hoare annotation is: true [2021-11-20 06:24:31,907 INFO L861 garLoopResultBuilder]: At program point kbtab_initENTRY(lines 3909 3925) the Hoare annotation is: true [2021-11-20 06:24:31,907 INFO L861 garLoopResultBuilder]: At program point L3471(lines 3465 3473) the Hoare annotation is: true [2021-11-20 06:24:31,907 INFO L858 garLoopResultBuilder]: For program point L3915(lines 3915 3918) no Hoare annotation was computed. [2021-11-20 06:24:31,907 INFO L858 garLoopResultBuilder]: For program point kbtab_initFINAL(lines 3909 3925) no Hoare annotation was computed. [2021-11-20 06:24:31,907 INFO L858 garLoopResultBuilder]: For program point L4210-1(line 4210) no Hoare annotation was computed. [2021-11-20 06:24:31,907 INFO L858 garLoopResultBuilder]: For program point dev_get_drvdataFINAL(lines 4209 4211) no Hoare annotation was computed. [2021-11-20 06:24:31,908 INFO L854 garLoopResultBuilder]: At program point dev_get_drvdataENTRY(lines 4209 4211) the Hoare annotation is: (or (not (= ~ldv_urb_state~0 1)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2021-11-20 06:24:31,908 INFO L854 garLoopResultBuilder]: At program point L4210(line 4210) the Hoare annotation is: (or (not (= ~ldv_urb_state~0 1)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2021-11-20 06:24:31,908 INFO L858 garLoopResultBuilder]: For program point dev_get_drvdataEXIT(lines 4209 4211) no Hoare annotation was computed. [2021-11-20 06:24:31,908 INFO L858 garLoopResultBuilder]: For program point kfreeEXIT(lines 4264 4266) no Hoare annotation was computed. [2021-11-20 06:24:31,908 INFO L854 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|)) [2021-11-20 06:24:31,908 INFO L858 garLoopResultBuilder]: For program point kfreeFINAL(lines 4264 4266) no Hoare annotation was computed. [2021-11-20 06:24:31,908 INFO L858 garLoopResultBuilder]: For program point L3437-1(line 3437) no Hoare annotation was computed. [2021-11-20 06:24:31,908 INFO L861 garLoopResultBuilder]: At program point L3437(line 3437) the Hoare annotation is: true [2021-11-20 06:24:31,908 INFO L861 garLoopResultBuilder]: At program point usb_set_intfdataENTRY(lines 3433 3441) the Hoare annotation is: true [2021-11-20 06:24:31,908 INFO L858 garLoopResultBuilder]: For program point usb_set_intfdataFINAL(lines 3433 3441) no Hoare annotation was computed. [2021-11-20 06:24:31,909 INFO L858 garLoopResultBuilder]: For program point usb_set_intfdataEXIT(lines 3433 3441) no Hoare annotation was computed. [2021-11-20 06:24:31,909 INFO L858 garLoopResultBuilder]: For program point L4239(line 4239) no Hoare annotation was computed. [2021-11-20 06:24:31,909 INFO L858 garLoopResultBuilder]: For program point ldv_undefined_pointerFINAL(lines 4238 4240) no Hoare annotation was computed. [2021-11-20 06:24:31,909 INFO L854 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 .cse1 (not (= ~ldv_coherent_state~0 1)) .cse2 (and (forall ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)) (forall ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)))) (or (not (= ~ldv_coherent_state~0 0)) .cse0 .cse1 .cse2))) [2021-11-20 06:24:31,909 INFO L858 garLoopResultBuilder]: For program point ldv_undefined_pointerEXIT(lines 4238 4240) no Hoare annotation was computed. [2021-11-20 06:24:31,910 INFO L861 garLoopResultBuilder]: At program point L4158(line 4158) the Hoare annotation is: true [2021-11-20 06:24:31,910 INFO L858 garLoopResultBuilder]: For program point L4156(lines 4154 4173) no Hoare annotation was computed. [2021-11-20 06:24:31,910 INFO L854 garLoopResultBuilder]: At program point L4154loopEntry(lines 4154 4173) the Hoare annotation is: (or (= ~ldv_urb_state~0 1) (not (= 1 |old(~ldv_urb_state~0)|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2021-11-20 06:24:31,910 INFO L858 garLoopResultBuilder]: For program point usb_free_urbEXIT(lines 4150 4179) no Hoare annotation was computed. [2021-11-20 06:24:31,910 INFO L854 garLoopResultBuilder]: At program point usb_free_urbENTRY(lines 4150 4179) the Hoare annotation is: (or (= ~ldv_urb_state~0 1) (not (= 1 |old(~ldv_urb_state~0)|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2021-11-20 06:24:31,911 INFO L858 garLoopResultBuilder]: For program point L4163(lines 4163 4168) no Hoare annotation was computed. [2021-11-20 06:24:31,911 INFO L858 garLoopResultBuilder]: For program point L4155(lines 4154 4173) no Hoare annotation was computed. [2021-11-20 06:24:31,911 INFO L854 garLoopResultBuilder]: At program point L4174(lines 4150 4179) the Hoare annotation is: (or (not (= 1 |old(~ldv_urb_state~0)|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0)) (and (= ~ldv_urb_state~0 0) (not (= (mod (+ usb_free_urb_~urb.base usb_free_urb_~urb.offset) 18446744073709551616) 0)))) [2021-11-20 06:24:31,911 INFO L854 garLoopResultBuilder]: At program point L4166(line 4166) the Hoare annotation is: (or (not (= 1 |old(~ldv_urb_state~0)|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2021-11-20 06:24:31,911 INFO L858 garLoopResultBuilder]: For program point L4166-1(lines 4163 4168) no Hoare annotation was computed. [2021-11-20 06:24:31,912 INFO L858 garLoopResultBuilder]: For program point input_set_abs_paramsEXIT(lines 4226 4228) no Hoare annotation was computed. [2021-11-20 06:24:31,912 INFO L861 garLoopResultBuilder]: At program point input_set_abs_paramsENTRY(lines 4226 4228) the Hoare annotation is: true [2021-11-20 06:24:31,913 INFO L858 garLoopResultBuilder]: For program point input_set_abs_paramsFINAL(lines 4226 4228) no Hoare annotation was computed. [2021-11-20 06:24:31,913 INFO L858 garLoopResultBuilder]: For program point kbtab_exitFINAL(lines 3928 3936) no Hoare annotation was computed. [2021-11-20 06:24:31,913 INFO L861 garLoopResultBuilder]: At program point L4250(lines 4249 4251) the Hoare annotation is: true [2021-11-20 06:24:31,914 INFO L861 garLoopResultBuilder]: At program point kbtab_exitENTRY(lines 3928 3936) the Hoare annotation is: true [2021-11-20 06:24:31,914 INFO L858 garLoopResultBuilder]: For program point kbtab_exitEXIT(lines 3928 3936) no Hoare annotation was computed. [2021-11-20 06:24:31,918 INFO L854 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 4201 4205) the Hoare annotation is: (let ((.cse2 (not (= ~ldv_coherent_state~0 1))) (.cse0 (not (= ~ldv_urb_state~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse3 (not (= 0 ~res_kbtab_probe_3~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and (forall ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)) (forall ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)))) (or (not (= ~ldv_urb_state~0 1)) .cse1 .cse2 .cse3) (or (not (= ~ldv_coherent_state~0 0)) .cse0 .cse1 .cse3))) [2021-11-20 06:24:31,919 INFO L858 garLoopResultBuilder]: For program point L4203(line 4203) no Hoare annotation was computed. [2021-11-20 06:24:31,920 INFO L858 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 4201 4205) no Hoare annotation was computed. [2021-11-20 06:24:31,920 INFO L858 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 4201 4205) no Hoare annotation was computed. [2021-11-20 06:24:31,921 INFO L854 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|)) (not (= 0 ~res_kbtab_probe_3~0))) [2021-11-20 06:24:31,921 INFO L858 garLoopResultBuilder]: For program point L4207-1(line 4207) no Hoare annotation was computed. [2021-11-20 06:24:31,921 INFO L861 garLoopResultBuilder]: At program point L4207-2(lines 4206 4208) the Hoare annotation is: true [2021-11-20 06:24:31,921 INFO L858 garLoopResultBuilder]: For program point kzallocEXIT(lines 3405 3413) no Hoare annotation was computed. [2021-11-20 06:24:31,923 INFO L861 garLoopResultBuilder]: At program point L3401(lines 3394 3403) the Hoare annotation is: true [2021-11-20 06:24:31,930 INFO L854 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|)) (not (= 0 ~res_kbtab_probe_3~0))) [2021-11-20 06:24:31,931 INFO L858 garLoopResultBuilder]: For program point kzallocFINAL(lines 3405 3413) no Hoare annotation was computed. [2021-11-20 06:24:31,931 INFO L861 garLoopResultBuilder]: At program point ldv_assume_stopENTRY(lines 4055 4061) the Hoare annotation is: true [2021-11-20 06:24:31,931 INFO L858 garLoopResultBuilder]: For program point ldv_assume_stopEXIT(lines 4055 4061) no Hoare annotation was computed. [2021-11-20 06:24:31,931 INFO L854 garLoopResultBuilder]: At program point L4117(lines 4093 4122) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_urb_state~0 0))) (.cse3 (not (= |old(~ldv_coherent_state~0)| 1)))) (and (let ((.cse1 (= |usb_free_coherent_#in~addr.base| usb_free_coherent_~addr.base)) (.cse2 (= |usb_free_coherent_#in~addr.offset| usb_free_coherent_~addr.offset))) (or .cse0 (and (= |usb_free_coherent_#in~addr.base| 0) (<= 1 ~ldv_coherent_state~0) (= |usb_free_coherent_#in~addr.offset| 0) .cse1 .cse2) .cse3 (and (= ~ldv_coherent_state~0 0) .cse1 .cse2))) (or (not (= (mod (+ usb_free_coherent_~addr.base usb_free_coherent_~addr.offset) 18446744073709551616) 0)) .cse0 (not (= 0 ~res_kbtab_probe_3~0)) .cse3))) [2021-11-20 06:24:31,932 INFO L854 garLoopResultBuilder]: At program point usb_free_coherentENTRY(lines 4093 4122) the Hoare annotation is: (or (= ~ldv_coherent_state~0 1) (not (= ~ldv_urb_state~0 0)) (not (= |old(~ldv_coherent_state~0)| 1))) [2021-11-20 06:24:31,932 INFO L858 garLoopResultBuilder]: For program point L4109-1(lines 4106 4111) no Hoare annotation was computed. [2021-11-20 06:24:31,932 INFO L854 garLoopResultBuilder]: At program point L4109(line 4109) the Hoare annotation is: (or (not (= ~ldv_urb_state~0 0)) (not (= |old(~ldv_coherent_state~0)| 1))) [2021-11-20 06:24:31,932 INFO L858 garLoopResultBuilder]: For program point usb_free_coherentEXIT(lines 4093 4122) no Hoare annotation was computed. [2021-11-20 06:24:31,932 INFO L861 garLoopResultBuilder]: At program point L4101(line 4101) the Hoare annotation is: true [2021-11-20 06:24:31,933 INFO L858 garLoopResultBuilder]: For program point L4099(lines 4097 4116) no Hoare annotation was computed. [2021-11-20 06:24:31,933 INFO L854 garLoopResultBuilder]: At program point L4097loopEntry(lines 4097 4116) the Hoare annotation is: (or (not (= ~ldv_urb_state~0 0)) (and (= ~ldv_coherent_state~0 1) (= |usb_free_coherent_#in~addr.base| usb_free_coherent_~addr.base) (= |usb_free_coherent_#in~addr.offset| usb_free_coherent_~addr.offset)) (not (= |old(~ldv_coherent_state~0)| 1))) [2021-11-20 06:24:31,933 INFO L858 garLoopResultBuilder]: For program point L4106(lines 4106 4111) no Hoare annotation was computed. [2021-11-20 06:24:31,933 INFO L858 garLoopResultBuilder]: For program point L4098(lines 4097 4116) no Hoare annotation was computed. [2021-11-20 06:24:31,933 INFO L854 garLoopResultBuilder]: At program point L4032(lines 3979 4033) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-11-20 06:24:31,934 INFO L858 garLoopResultBuilder]: For program point L3487(lines 3487 3494) no Hoare annotation was computed. [2021-11-20 06:24:31,934 INFO L854 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)) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)))) [2021-11-20 06:24:31,934 INFO L854 garLoopResultBuilder]: At program point L4247(lines 4246 4248) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~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)) [2021-11-20 06:24:31,934 INFO L854 garLoopResultBuilder]: At program point L3884(line 3884) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2021-11-20 06:24:31,934 INFO L858 garLoopResultBuilder]: For program point L3851(lines 3851 3854) no Hoare annotation was computed. [2021-11-20 06:24:31,935 INFO L858 garLoopResultBuilder]: For program point L3884-1(line 3884) no Hoare annotation was computed. [2021-11-20 06:24:31,935 INFO L858 garLoopResultBuilder]: For program point L4132(line 4132) no Hoare annotation was computed. [2021-11-20 06:24:31,935 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-20 06:24:31,935 INFO L858 garLoopResultBuilder]: For program point L3802(lines 3802 3808) no Hoare annotation was computed. [2021-11-20 06:24:31,935 INFO L854 garLoopResultBuilder]: At program point L3852(lines 3793 3873) the Hoare annotation is: (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~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))) [2021-11-20 06:24:31,936 INFO L858 garLoopResultBuilder]: For program point L3885-1(line 3885) no Hoare annotation was computed. [2021-11-20 06:24:31,936 INFO L854 garLoopResultBuilder]: At program point L3885(line 3885) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 1)) [2021-11-20 06:24:31,936 INFO L858 garLoopResultBuilder]: For program point L3456(lines 3456 3460) no Hoare annotation was computed. [2021-11-20 06:24:31,936 INFO L858 garLoopResultBuilder]: For program point L3456-2(lines 3456 3460) no Hoare annotation was computed. [2021-11-20 06:24:31,936 INFO L858 garLoopResultBuilder]: For program point L3985(lines 3985 3990) no Hoare annotation was computed. [2021-11-20 06:24:31,937 INFO L854 garLoopResultBuilder]: At program point L3886(line 3886) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= ~ldv_urb_state~0 0)) [2021-11-20 06:24:31,937 INFO L858 garLoopResultBuilder]: For program point L3820(lines 3820 3823) no Hoare annotation was computed. [2021-11-20 06:24:31,937 INFO L854 garLoopResultBuilder]: At program point L3886-1(lines 3875 3890) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= ~ldv_urb_state~0 0)) [2021-11-20 06:24:31,937 INFO L854 garLoopResultBuilder]: At program point L4233(lines 4232 4234) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse3 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse5 (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse4 (= 0 ~res_kbtab_probe_3~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 .cse3 .cse4 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) .cse2 .cse5) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse3 (not .cse5) .cse1 .cse2 (not .cse4)))) [2021-11-20 06:24:31,937 INFO L858 garLoopResultBuilder]: For program point L3490(lines 3490 3494) no Hoare annotation was computed. [2021-11-20 06:24:31,938 INFO L858 garLoopResultBuilder]: For program point L3490-2(lines 3487 3494) no Hoare annotation was computed. [2021-11-20 06:24:31,938 INFO L854 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)) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)))) [2021-11-20 06:24:31,939 INFO L858 garLoopResultBuilder]: For program point L3870-1(line 3870) no Hoare annotation was computed. [2021-11-20 06:24:31,939 INFO L858 garLoopResultBuilder]: For program point L4184(lines 4184 4189) no Hoare annotation was computed. [2021-11-20 06:24:31,939 INFO L858 garLoopResultBuilder]: For program point L4135(lines 4135 4138) no Hoare annotation was computed. [2021-11-20 06:24:31,939 INFO L858 garLoopResultBuilder]: For program point L3805(lines 3805 3808) no Hoare annotation was computed. [2021-11-20 06:24:31,940 INFO L858 garLoopResultBuilder]: For program point L4086(lines 4071 4087) no Hoare annotation was computed. [2021-11-20 06:24:31,940 INFO L858 garLoopResultBuilder]: For program point L3987-1(lines 3985 3990) no Hoare annotation was computed. [2021-11-20 06:24:31,940 INFO L858 garLoopResultBuilder]: For program point L3987(lines 3987 3990) no Hoare annotation was computed. [2021-11-20 06:24:31,940 INFO L854 garLoopResultBuilder]: At program point L4037(lines 3968 4044) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2021-11-20 06:24:31,940 INFO L854 garLoopResultBuilder]: At program point L3426(line 3426) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2021-11-20 06:24:31,941 INFO L854 garLoopResultBuilder]: At program point L3872(lines 3782 3874) the Hoare annotation is: (let ((.cse4 (= ~ldv_coherent_state~0 0)) (.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0)) (.cse3 (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) (.cse5 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .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 .cse1 (not .cse3) .cse5 .cse2))) [2021-11-20 06:24:31,941 INFO L858 garLoopResultBuilder]: For program point L3426-1(line 3426) no Hoare annotation was computed. [2021-11-20 06:24:31,941 INFO L854 garLoopResultBuilder]: At program point L3839-1(line 3839) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~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)) [2021-11-20 06:24:31,941 INFO L854 garLoopResultBuilder]: At program point L3839(line 3839) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~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)) [2021-11-20 06:24:31,942 INFO L854 garLoopResultBuilder]: At program point L3509(lines 3506 3511) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~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)) [2021-11-20 06:24:31,942 INFO L854 garLoopResultBuilder]: At program point L3856(line 3856) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~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))) [2021-11-20 06:24:31,942 INFO L858 garLoopResultBuilder]: For program point L3856-1(line 3856) no Hoare annotation was computed. [2021-11-20 06:24:31,942 INFO L854 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)) [2021-11-20 06:24:31,942 INFO L854 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)) [2021-11-20 06:24:31,943 INFO L858 garLoopResultBuilder]: For program point L3972-1(line 3972) no Hoare annotation was computed. [2021-11-20 06:24:31,943 INFO L854 garLoopResultBuilder]: At program point L3840(line 3840) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~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)) [2021-11-20 06:24:31,943 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-20 06:24:31,943 INFO L858 garLoopResultBuilder]: For program point L4187-1(lines 4183 4197) no Hoare annotation was computed. [2021-11-20 06:24:31,943 INFO L854 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)) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)))) [2021-11-20 06:24:31,944 INFO L854 garLoopResultBuilder]: At program point L4187(line 4187) the Hoare annotation is: false [2021-11-20 06:24:31,944 INFO L854 garLoopResultBuilder]: At program point L3576(lines 3569 3578) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~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)) [2021-11-20 06:24:31,944 INFO L854 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)) [2021-11-20 06:24:31,944 INFO L854 garLoopResultBuilder]: At program point L3428(lines 3422 3430) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2021-11-20 06:24:31,945 INFO L854 garLoopResultBuilder]: At program point L3461(lines 3449 3463) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~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)) [2021-11-20 06:24:31,945 INFO L858 garLoopResultBuilder]: For program point L3841(line 3841) no Hoare annotation was computed. [2021-11-20 06:24:31,945 INFO L854 garLoopResultBuilder]: At program point L4089(lines 4066 4091) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.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) .cse0 .cse1 (= |ULTIMATE.start_usb_alloc_coherent_#res#1.offset| 0) .cse2 .cse3 .cse4) (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 (= ~ldv_coherent_state~0 1) .cse3 (not .cse2) .cse4))) [2021-11-20 06:24:31,945 INFO L854 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)) [2021-11-20 06:24:31,945 INFO L858 garLoopResultBuilder]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2021-11-20 06:24:31,946 INFO L854 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)) [2021-11-20 06:24:31,946 INFO L858 garLoopResultBuilder]: For program point L3529-1(line 3529) no Hoare annotation was computed. [2021-11-20 06:24:31,946 INFO L854 garLoopResultBuilder]: At program point L3496(lines 3475 3498) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~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)) [2021-11-20 06:24:31,946 INFO L858 garLoopResultBuilder]: For program point L4008(lines 4008 4011) no Hoare annotation was computed. [2021-11-20 06:24:31,946 INFO L854 garLoopResultBuilder]: At program point L3529(line 3529) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~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)) [2021-11-20 06:24:31,947 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-20 06:24:31,947 INFO L858 garLoopResultBuilder]: For program point L3513-1(line 3513) no Hoare annotation was computed. [2021-11-20 06:24:31,948 INFO L854 garLoopResultBuilder]: At program point L3513(line 3513) 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)) [2021-11-20 06:24:31,948 INFO L854 garLoopResultBuilder]: At program point L3513-2(lines 3512 3514) 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)) [2021-11-20 06:24:31,948 INFO L858 garLoopResultBuilder]: For program point L4075(line 4075) no Hoare annotation was computed. [2021-11-20 06:24:31,948 INFO L854 garLoopResultBuilder]: At program point L4224(lines 4223 4225) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~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)) [2021-11-20 06:24:31,948 INFO L858 garLoopResultBuilder]: For program point L3861-1(line 3861) no Hoare annotation was computed. [2021-11-20 06:24:31,949 INFO L854 garLoopResultBuilder]: At program point L3861(line 3861) the Hoare annotation is: (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~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))) [2021-11-20 06:24:31,949 INFO L854 garLoopResultBuilder]: At program point L3531(lines 3525 3533) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~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)) [2021-11-20 06:24:31,949 INFO L854 garLoopResultBuilder]: At program point L4043(lines 3961 4045) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2021-11-20 06:24:31,949 INFO L858 garLoopResultBuilder]: For program point L3994(lines 3994 4030) no Hoare annotation was computed. [2021-11-20 06:24:31,949 INFO L858 garLoopResultBuilder]: For program point L4143(lines 4128 4144) no Hoare annotation was computed. [2021-11-20 06:24:31,950 INFO L858 garLoopResultBuilder]: For program point L3813(lines 3813 3816) no Hoare annotation was computed. [2021-11-20 06:24:31,950 INFO L854 garLoopResultBuilder]: At program point L4193-1(lines 4181 4198) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2021-11-20 06:24:31,950 INFO L854 garLoopResultBuilder]: At program point L4193(line 4193) the Hoare annotation is: false [2021-11-20 06:24:31,950 INFO L854 garLoopResultBuilder]: At program point L4028(lines 3980 4031) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|))) (or (and .cse0 (<= 0 ~ldv_coherent_state~0) .cse1 .cse2 (<= 0 ~ldv_urb_state~0) (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (and (= ~ldv_coherent_state~0 0) .cse1 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (and .cse0 .cse1 .cse2 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)))) [2021-11-20 06:24:31,950 INFO L854 garLoopResultBuilder]: At program point L3995(lines 3994 4030) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|))) (or (and .cse0 (<= 0 ~ldv_coherent_state~0) .cse1 .cse2 (<= 0 ~ldv_urb_state~0) (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (and (= ~ldv_coherent_state~0 0) .cse1 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (and .cse0 .cse1 .cse2 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)))) [2021-11-20 06:24:31,951 INFO L854 garLoopResultBuilder]: At program point L3863(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= ~ldv_coherent_state~0 1)) (.cse3 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse4 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 .cse3 .cse4))) [2021-11-20 06:24:31,951 INFO L858 garLoopResultBuilder]: For program point L4078(lines 4078 4081) no Hoare annotation was computed. [2021-11-20 06:24:31,953 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-20 06:24:31,953 INFO L854 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)) [2021-11-20 06:24:31,953 INFO L858 garLoopResultBuilder]: For program point L3798-1(line 3798) no Hoare annotation was computed. [2021-11-20 06:24:31,953 INFO L854 garLoopResultBuilder]: At program point L4129loopEntry(lines 4129 4142) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 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)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-11-20 06:24:31,953 INFO L858 garLoopResultBuilder]: For program point L3997(lines 3997 4030) no Hoare annotation was computed. [2021-11-20 06:24:31,953 INFO L858 garLoopResultBuilder]: For program point L3865-1(line 3865) no Hoare annotation was computed. [2021-11-20 06:24:31,954 INFO L854 garLoopResultBuilder]: At program point L3865(line 3865) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= ~ldv_coherent_state~0 1)) (.cse3 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse4 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)))) (or (and .cse0 (or (not (= |ULTIMATE.start_kbtab_probe_#t~mem80#1.base| 0)) (not (= |ULTIMATE.start_kbtab_probe_#t~mem80#1.offset| 0))) .cse1 .cse2 .cse3 .cse4 (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 .cse3 .cse4))) [2021-11-20 06:24:31,954 INFO L854 garLoopResultBuilder]: At program point L4146(lines 4124 4148) the Hoare annotation is: (let ((.cse2 (= ~ldv_coherent_state~0 1)) (.cse7 (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) (.cse5 (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)))) (.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse3 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse4 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) (.cse6 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (.cse1 (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0))) (or (and .cse0 .cse1 (= ~ldv_urb_state~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= 0 ~res_kbtab_probe_3~0) .cse2 (= ~ldv_urb_state~0 1) (let ((.cse8 (not .cse1))) (or (and .cse0 (or .cse8 (not .cse7)) .cse3 .cse4 .cse5 .cse6) (and .cse0 (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) .cse3 .cse4 .cse8 .cse6)))))) [2021-11-20 06:24:31,954 INFO L858 garLoopResultBuilder]: For program point L3981(line 3981) no Hoare annotation was computed. [2021-11-20 06:24:31,954 INFO L854 garLoopResultBuilder]: At program point L3882(line 3882) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2021-11-20 06:24:31,954 INFO L858 garLoopResultBuilder]: For program point L3882-1(line 3882) no Hoare annotation was computed. [2021-11-20 06:24:31,954 INFO L854 garLoopResultBuilder]: At program point L4130(line 4130) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 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)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-11-20 06:24:31,954 INFO L854 garLoopResultBuilder]: At program point L3998(lines 3997 4030) the Hoare annotation is: (let ((.cse3 (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| |ULTIMATE.start_main_~tmp___8~3#1|))) (.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|))) (or (and .cse0 (<= 0 ~ldv_coherent_state~0) .cse1 .cse2 .cse3 (<= 0 ~ldv_urb_state~0) (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (and (= ~ldv_coherent_state~0 0) .cse1 .cse3 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (and .cse0 .cse1 .cse2 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)))) [2021-11-20 06:24:31,954 INFO L854 garLoopResultBuilder]: At program point L4230(lines 4229 4231) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2021-11-20 06:24:31,955 INFO L861 garLoopResultBuilder]: At program point ldv_blast_assertENTRY(lines 4046 4051) the Hoare annotation is: true [2021-11-20 06:24:31,955 INFO L858 garLoopResultBuilder]: For program point ldv_blast_assertEXIT(lines 4046 4051) no Hoare annotation was computed. [2021-11-20 06:24:31,955 INFO L858 garLoopResultBuilder]: For program point ldv_blast_assertFINAL(lines 4046 4051) no Hoare annotation was computed. [2021-11-20 06:24:31,955 INFO L858 garLoopResultBuilder]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-11-20 06:24:31,955 INFO L858 garLoopResultBuilder]: For program point dev_set_drvdataFINAL(lines 4213 4215) no Hoare annotation was computed. [2021-11-20 06:24:31,955 INFO L858 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 4213 4215) no Hoare annotation was computed. [2021-11-20 06:24:31,955 INFO L861 garLoopResultBuilder]: At program point dev_set_drvdataENTRY(lines 4213 4215) the Hoare annotation is: true [2021-11-20 06:24:31,959 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:24:31,961 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 06:24:31,989 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:24:31,993 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:24:31,994 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:24:31,995 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:24:32,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:24:32,020 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:24:32,021 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:24:32,021 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:24:32,045 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:24:32,045 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:24:32,045 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:24:32,046 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:24:32,048 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:24:32,048 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:24:32,048 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:24:32,048 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:24:32,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:24:32 BoogieIcfgContainer [2021-11-20 06:24:32,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 06:24:32,064 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 06:24:32,064 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 06:24:32,065 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 06:24:32,065 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:23:19" (3/4) ... [2021-11-20 06:24:32,069 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-20 06:24:32,077 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_init [2021-11-20 06:24:32,077 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_get_drvdata [2021-11-20 06:24:32,077 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2021-11-20 06:24:32,078 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2021-11-20 06:24:32,078 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2021-11-20 06:24:32,078 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2021-11-20 06:24:32,078 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_abs_params [2021-11-20 06:24:32,078 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_exit [2021-11-20 06:24:32,078 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2021-11-20 06:24:32,079 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2021-11-20 06:24:32,079 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2021-11-20 06:24:32,079 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2021-11-20 06:24:32,080 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2021-11-20 06:24:32,080 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2021-11-20 06:24:32,103 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 73 nodes and edges [2021-11-20 06:24:32,105 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2021-11-20 06:24:32,107 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-11-20 06:24:32,109 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-20 06:24:32,111 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-20 06:24:32,146 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(1 == \old(ldv_urb_state)) || !(ldv_coherent_state == 1)) || !(0 == res_kbtab_probe_3)) || (ldv_urb_state == 0 && !((urb + urb) % 18446744073709551616 == 0)) [2021-11-20 06:24:32,146 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(ldv_urb_state == 0) || ((((addr == 0 && 1 <= ldv_coherent_state) && addr == 0) && addr == addr) && addr == addr)) || !(\old(ldv_coherent_state) == 1)) || ((ldv_coherent_state == 0 && addr == addr) && addr == addr)) && (((!((addr + addr) % 18446744073709551616 == 0) || !(ldv_urb_state == 0)) || !(0 == res_kbtab_probe_3)) || !(\old(ldv_coherent_state) == 1)) [2021-11-20 06:24:32,147 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0) || ((((((!(error == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) [2021-11-20 06:24:32,148 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_urb_state == 0) || ((ldv_coherent_state == 1 && addr == addr) && addr == addr)) || !(\old(ldv_coherent_state) == 1) [2021-11-20 06:24:32,148 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 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)) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) [2021-11-20 06:24:32,149 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) || (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0)) || ((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(0 == res_kbtab_probe_3)) [2021-11-20 06:24:32,151 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && ldv_urb_state == 0) && \result == 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && 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) [2021-11-20 06:24:32,152 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((arbitrary_memory == 0 && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0) && 0 == \result) || (((0 == res_kbtab_probe_3 && ldv_coherent_state == 1) && ldv_urb_state == 1) && ((((((arbitrary_memory == 0 && (!(\result == 0) || !(0 == \result))) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0) || (((((arbitrary_memory == 0 && !(arbitrary_memory == 0)) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && error + 12 <= 0))) [2021-11-20 06:24:32,152 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2021-11-20 06:24:32,153 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_urb_state == 1 || !(1 == \old(ldv_urb_state))) || !(ldv_coherent_state == 1)) || !(0 == res_kbtab_probe_3) [2021-11-20 06:24:32,154 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0 [2021-11-20 06:24:32,155 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2021-11-20 06:24:32,156 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2021-11-20 06:24:32,156 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2021-11-20 06:24:32,157 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2021-11-20 06:24:32,157 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2021-11-20 06:24:32,158 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2021-11-20 06:24:32,158 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(error == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0) [2021-11-20 06:24:32,392 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/witness.graphml [2021-11-20 06:24:32,392 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 06:24:32,393 INFO L158 Benchmark]: Toolchain (without parser) took 75905.63ms. Allocated memory was 113.2MB in the beginning and 612.4MB in the end (delta: 499.1MB). Free memory was 67.0MB in the beginning and 337.4MB in the end (delta: -270.5MB). Peak memory consumption was 228.7MB. Max. memory is 16.1GB. [2021-11-20 06:24:32,393 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 113.2MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 06:24:32,394 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1265.72ms. Allocated memory was 113.2MB in the beginning and 138.4MB in the end (delta: 25.2MB). Free memory was 66.8MB in the beginning and 79.9MB in the end (delta: -13.1MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2021-11-20 06:24:32,395 INFO L158 Benchmark]: Boogie Procedure Inliner took 133.19ms. Allocated memory is still 138.4MB. Free memory was 79.9MB in the beginning and 74.4MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-11-20 06:24:32,398 INFO L158 Benchmark]: Boogie Preprocessor took 71.22ms. Allocated memory is still 138.4MB. Free memory was 74.4MB in the beginning and 69.0MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-20 06:24:32,399 INFO L158 Benchmark]: RCFGBuilder took 1599.06ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 69.0MB in the beginning and 121.0MB in the end (delta: -52.0MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2021-11-20 06:24:32,402 INFO L158 Benchmark]: TraceAbstraction took 72498.07ms. Allocated memory was 188.7MB in the beginning and 612.4MB in the end (delta: 423.6MB). Free memory was 120.0MB in the beginning and 399.8MB in the end (delta: -279.8MB). Peak memory consumption was 348.3MB. Max. memory is 16.1GB. [2021-11-20 06:24:32,403 INFO L158 Benchmark]: Witness Printer took 328.43ms. Allocated memory is still 612.4MB. Free memory was 398.7MB in the beginning and 337.4MB in the end (delta: 61.3MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2021-11-20 06:24:32,409 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 113.2MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1265.72ms. Allocated memory was 113.2MB in the beginning and 138.4MB in the end (delta: 25.2MB). Free memory was 66.8MB in the beginning and 79.9MB in the end (delta: -13.1MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 133.19ms. Allocated memory is still 138.4MB. Free memory was 79.9MB in the beginning and 74.4MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.22ms. Allocated memory is still 138.4MB. Free memory was 74.4MB in the beginning and 69.0MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1599.06ms. Allocated memory was 138.4MB in the beginning and 188.7MB in the end (delta: 50.3MB). Free memory was 69.0MB in the beginning and 121.0MB in the end (delta: -52.0MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. * TraceAbstraction took 72498.07ms. Allocated memory was 188.7MB in the beginning and 612.4MB in the end (delta: 423.6MB). Free memory was 120.0MB in the beginning and 399.8MB in the end (delta: -279.8MB). Peak memory consumption was 348.3MB. Max. memory is 16.1GB. * Witness Printer took 328.43ms. Allocated memory is still 612.4MB. Free memory was 398.7MB in the beginning and 337.4MB in the end (delta: 61.3MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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, 164 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.3s, OverallIterations: 23, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 39.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3038 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2936 mSDsluCounter, 18427 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 238 IncrementalHoareTripleChecker+Unchecked, 13412 mSDsCounter, 549 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1697 IncrementalHoareTripleChecker+Invalid, 2484 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 549 mSolverCounterUnsat, 5015 mSDtfsCounter, 1697 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3036 GetRequests, 2750 SyntacticMatches, 4 SemanticMatches, 282 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1210occurred in iteration=13, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 1454 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 81 LocationsWithAnnotation, 3470 PreInvPairs, 3685 NumberOfFragments, 1821 HoareAnnotationTreeSize, 3470 FomulaSimplifications, 377630 FormulaSimplificationTreeSizeReduction, 25.0s HoareSimplificationTime, 81 FomulaSimplificationsInter, 269316 FormulaSimplificationTreeSizeReductionInter, 14.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 4605 NumberOfCodeBlocks, 4503 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 4671 ConstructedInterpolants, 8 QuantifiedInterpolants, 9770 SizeOfPredicates, 88 NumberOfNonLiveVariables, 18509 ConjunctsInSsa, 284 ConjunctsInUnsatCore, 42 InterpolantComputations, 23 PerfectInterpolantSequences, 1329/1543 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: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 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)) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && !(\result == 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 - InvariantResult [Line: 3449]: Loop Invariant Derived loop invariant: (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 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: (((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && ldv_coherent_state == 1) && ldv_urb_state == 1 - InvariantResult [Line: 3525]: Loop Invariant Derived loop invariant: (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 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: (((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && ldv_coherent_state == 1) && ldv_urb_state == 1 - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: (((((!(error == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && 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: (!(ldv_urb_state == 0) || ((ldv_coherent_state == 1 && addr == addr) && addr == addr)) || !(\old(ldv_coherent_state) == 1) - 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: (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 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 [2021-11-20 06:24:32,437 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:24:32,438 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:24:32,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:24:32,439 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((arbitrary_memory == 0 && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0) || ((((((!(error == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && 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: (((!(ldv_urb_state == 0) || ((((addr == 0 && 1 <= ldv_coherent_state) && addr == 0) && addr == addr) && addr == addr)) || !(\old(ldv_coherent_state) == 1)) || ((ldv_coherent_state == 0 && addr == addr) && addr == addr)) && (((!((addr + addr) % 18446744073709551616 == 0) || !(ldv_urb_state == 0)) || !(0 == res_kbtab_probe_3)) || !(\old(ldv_coherent_state) == 1)) - InvariantResult [Line: 3875]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && ldv_urb_state == 0 - InvariantResult [Line: 3994]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && ldv_coherent_state == 1) && ldv_urb_state == 1) - 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: ((((((arbitrary_memory == 0 && 0 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0)) || ((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && ldv_coherent_state == 1) && ldv_urb_state == 1) - InvariantResult [Line: 4129]: Loop Invariant [2021-11-20 06:24:32,444 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:24:32,444 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:24:32,445 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:24:32,445 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 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) || (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0)) || ((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && !(\result == 0)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(0 == res_kbtab_probe_3)) - InvariantResult [Line: 4124]: Loop Invariant [2021-11-20 06:24:32,447 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:24:32,447 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:24:32,448 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:24:32,448 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:24:32,449 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:24:32,449 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-20 06:24:32,450 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-20 06:24:32,450 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((arbitrary_memory == 0 && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0) && 0 == \result) || (((0 == res_kbtab_probe_3 && ldv_coherent_state == 1) && ldv_urb_state == 1) && ((((((arbitrary_memory == 0 && (!(\result == 0) || !(0 == \result))) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0) || (((((arbitrary_memory == 0 && !(arbitrary_memory == 0)) && 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)) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && 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) && ldv_urb_state == 0) && \result == 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && 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: ((!(1 == \old(ldv_urb_state)) || !(ldv_coherent_state == 1)) || !(0 == res_kbtab_probe_3)) || (ldv_urb_state == 0 && !((urb + urb) % 18446744073709551616 == 0)) - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && 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: (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 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: ((ldv_urb_state == 1 || !(1 == \old(ldv_urb_state))) || !(ldv_coherent_state == 1)) || !(0 == res_kbtab_probe_3) - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 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: (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 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: (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 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: (((((((arbitrary_memory == 0 && 0 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 0 <= ldv_urb_state) && !(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)) || ((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && ldv_coherent_state == 1) && ldv_urb_state == 1) RESULT: Ultimate proved your program to be correct! [2021-11-20 06:24:32,524 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65e5624c-b583-4d11-8ba8-557b62007197/bin/uautomizer-DQz5hQGWxF/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