./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 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/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_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa --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.2-hotfix-svcomp22-839c364 [2021-12-06 21:57:54,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 21:57:54,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 21:57:54,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 21:57:54,415 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 21:57:54,416 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 21:57:54,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 21:57:54,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 21:57:54,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 21:57:54,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 21:57:54,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 21:57:54,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 21:57:54,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 21:57:54,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 21:57:54,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 21:57:54,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 21:57:54,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 21:57:54,429 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 21:57:54,430 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 21:57:54,432 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 21:57:54,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 21:57:54,435 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 21:57:54,436 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 21:57:54,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 21:57:54,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 21:57:54,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 21:57:54,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 21:57:54,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 21:57:54,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 21:57:54,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 21:57:54,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 21:57:54,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 21:57:54,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 21:57:54,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 21:57:54,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 21:57:54,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 21:57:54,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 21:57:54,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 21:57:54,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 21:57:54,447 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 21:57:54,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 21:57:54,448 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-06 21:57:54,466 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 21:57:54,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 21:57:54,467 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 21:57:54,467 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 21:57:54,467 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 21:57:54,467 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 21:57:54,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 21:57:54,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 21:57:54,468 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 21:57:54,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 21:57:54,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 21:57:54,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 21:57:54,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 21:57:54,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 21:57:54,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 21:57:54,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 21:57:54,469 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 21:57:54,470 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 21:57:54,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 21:57:54,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 21:57:54,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 21:57:54,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 21:57:54,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 21:57:54,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 21:57:54,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 21:57:54,474 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 21:57:54,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 21:57:54,475 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 21:57:54,475 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 21:57:54,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 21:57:54,475 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 21:57:54,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/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_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa 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-12-06 21:57:54,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 21:57:54,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 21:57:54,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 21:57:54,688 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 21:57:54,689 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 21:57:54,690 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2021-12-06 21:57:54,732 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/data/78cc1b14d/c6e0732c8e854514b9bbc7600d07feaf/FLAG3d302aebb [2021-12-06 21:57:55,279 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 21:57:55,280 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2021-12-06 21:57:55,298 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/data/78cc1b14d/c6e0732c8e854514b9bbc7600d07feaf/FLAG3d302aebb [2021-12-06 21:57:55,716 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/data/78cc1b14d/c6e0732c8e854514b9bbc7600d07feaf [2021-12-06 21:57:55,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 21:57:55,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 21:57:55,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 21:57:55,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 21:57:55,724 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 21:57:55,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 09:57:55" (1/1) ... [2021-12-06 21:57:55,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be7e0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:57:55, skipping insertion in model container [2021-12-06 21:57:55,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 09:57:55" (1/1) ... [2021-12-06 21:57:55,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 21:57:55,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 21:57:56,209 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_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2021-12-06 21:57:56,241 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 21:57:56,287 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 21:57:56,380 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_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2021-12-06 21:57:56,386 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 21:57:56,439 INFO L208 MainTranslator]: Completed translation [2021-12-06 21:57:56,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:57:56 WrapperNode [2021-12-06 21:57:56,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 21:57:56,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 21:57:56,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 21:57:56,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 21:57:56,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:57:56" (1/1) ... [2021-12-06 21:57:56,483 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:57:56" (1/1) ... [2021-12-06 21:57:56,525 INFO L137 Inliner]: procedures = 77, calls = 256, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 728 [2021-12-06 21:57:56,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 21:57:56,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 21:57:56,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 21:57:56,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 21:57:56,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:57:56" (1/1) ... [2021-12-06 21:57:56,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:57:56" (1/1) ... [2021-12-06 21:57:56,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:57:56" (1/1) ... [2021-12-06 21:57:56,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:57:56" (1/1) ... [2021-12-06 21:57:56,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:57:56" (1/1) ... [2021-12-06 21:57:56,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:57:56" (1/1) ... [2021-12-06 21:57:56,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:57:56" (1/1) ... [2021-12-06 21:57:56,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 21:57:56,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 21:57:56,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 21:57:56,586 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 21:57:56,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:57:56" (1/1) ... [2021-12-06 21:57:56,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 21:57:56,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:57:56,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 21:57:56,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 21:57:56,641 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2021-12-06 21:57:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2021-12-06 21:57:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 21:57:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2021-12-06 21:57:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2021-12-06 21:57:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-06 21:57:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2021-12-06 21:57:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2021-12-06 21:57:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2021-12-06 21:57:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2021-12-06 21:57:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2021-12-06 21:57:56,642 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2021-12-06 21:57:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-06 21:57:56,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-06 21:57:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2021-12-06 21:57:56,643 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2021-12-06 21:57:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-06 21:57:56,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-06 21:57:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2021-12-06 21:57:56,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2021-12-06 21:57:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-06 21:57:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2021-12-06 21:57:56,643 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2021-12-06 21:57:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-06 21:57:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-06 21:57:56,643 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-06 21:57:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-06 21:57:56,643 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-12-06 21:57:56,644 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-12-06 21:57:56,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2021-12-06 21:57:56,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2021-12-06 21:57:56,644 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2021-12-06 21:57:56,644 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2021-12-06 21:57:56,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2021-12-06 21:57:56,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2021-12-06 21:57:56,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 21:57:56,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-06 21:57:56,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 21:57:56,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 21:57:56,790 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 21:57:56,792 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 21:57:56,887 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2021-12-06 21:57:56,901 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-06 21:57:57,405 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-12-06 21:57:57,405 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-12-06 21:57:57,414 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 21:57:57,421 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 21:57:57,421 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-06 21:57:57,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 09:57:57 BoogieIcfgContainer [2021-12-06 21:57:57,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 21:57:57,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 21:57:57,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 21:57:57,427 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 21:57:57,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 09:57:55" (1/3) ... [2021-12-06 21:57:57,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6901c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 09:57:57, skipping insertion in model container [2021-12-06 21:57:57,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 09:57:56" (2/3) ... [2021-12-06 21:57:57,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e6901c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 09:57:57, skipping insertion in model container [2021-12-06 21:57:57,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 09:57:57" (3/3) ... [2021-12-06 21:57:57,429 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2021-12-06 21:57:57,433 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 21:57:57,433 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 21:57:57,470 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 21:57:57,475 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-12-06 21:57:57,475 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 21:57:57,492 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-12-06 21:57:57,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-06 21:57:57,496 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:57:57,496 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:57:57,496 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:57:57,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:57:57,500 INFO L85 PathProgramCache]: Analyzing trace with hash 567277314, now seen corresponding path program 1 times [2021-12-06 21:57:57,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:57:57,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267717578] [2021-12-06 21:57:57,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:57:57,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:57:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:57,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:57:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:57,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:57:57,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:57:57,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267717578] [2021-12-06 21:57:57,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267717578] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:57:57,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:57:57,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 21:57:57,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689305693] [2021-12-06 21:57:57,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:57:57,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 21:57:57,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:57:57,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 21:57:57,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 21:57:57,860 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-12-06 21:57:57,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:57:57,923 INFO L93 Difference]: Finished difference Result 447 states and 604 transitions. [2021-12-06 21:57:57,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 21:57:57,925 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-12-06 21:57:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:57:57,934 INFO L225 Difference]: With dead ends: 447 [2021-12-06 21:57:57,934 INFO L226 Difference]: Without dead ends: 287 [2021-12-06 21:57:57,938 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-12-06 21:57:57,940 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-12-06 21:57:57,941 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-12-06 21:57:57,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-12-06 21:57:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 283. [2021-12-06 21:57:57,991 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-12-06 21:57:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 350 transitions. [2021-12-06 21:57:57,996 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 350 transitions. Word has length 17 [2021-12-06 21:57:57,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:57:57,997 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 350 transitions. [2021-12-06 21:57:57,997 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-12-06 21:57:57,997 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 350 transitions. [2021-12-06 21:57:57,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-06 21:57:57,997 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:57:57,997 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 21:57:57,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 21:57:57,998 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:57:57,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:57:57,998 INFO L85 PathProgramCache]: Analyzing trace with hash 405605840, now seen corresponding path program 1 times [2021-12-06 21:57:57,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:57:57,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857862458] [2021-12-06 21:57:57,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:57:57,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:57:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:58,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:57:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:57:58,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:57:58,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857862458] [2021-12-06 21:57:58,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857862458] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:57:58,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:57:58,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 21:57:58,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021478581] [2021-12-06 21:57:58,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:57:58,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 21:57:58,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:57:58,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 21:57:58,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 21:57:58,105 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-12-06 21:57:58,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:57:58,157 INFO L93 Difference]: Finished difference Result 820 states and 1021 transitions. [2021-12-06 21:57:58,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 21:57:58,158 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-12-06 21:57:58,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:57:58,164 INFO L225 Difference]: With dead ends: 820 [2021-12-06 21:57:58,164 INFO L226 Difference]: Without dead ends: 542 [2021-12-06 21:57:58,167 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-12-06 21:57:58,168 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-12-06 21:57:58,168 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-12-06 21:57:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2021-12-06 21:57:58,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 535. [2021-12-06 21:57:58,207 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-12-06 21:57:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 662 transitions. [2021-12-06 21:57:58,211 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 662 transitions. Word has length 18 [2021-12-06 21:57:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:57:58,211 INFO L470 AbstractCegarLoop]: Abstraction has 535 states and 662 transitions. [2021-12-06 21:57:58,212 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-12-06 21:57:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 662 transitions. [2021-12-06 21:57:58,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-06 21:57:58,213 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:57:58,213 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-12-06 21:57:58,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 21:57:58,214 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:57:58,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:57:58,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1497198459, now seen corresponding path program 1 times [2021-12-06 21:57:58,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:57:58,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832947937] [2021-12-06 21:57:58,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:57:58,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:57:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:58,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:57:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:58,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 21:57:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:58,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:57:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:58,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-06 21:57:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:58,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:57:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:57:58,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:57:58,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832947937] [2021-12-06 21:57:58,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832947937] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:57:58,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:57:58,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 21:57:58,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243996271] [2021-12-06 21:57:58,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:57:58,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 21:57:58,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:57:58,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 21:57:58,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:57:58,370 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-12-06 21:57:58,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:57:58,589 INFO L93 Difference]: Finished difference Result 1114 states and 1383 transitions. [2021-12-06 21:57:58,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 21:57:58,590 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-12-06 21:57:58,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:57:58,596 INFO L225 Difference]: With dead ends: 1114 [2021-12-06 21:57:58,596 INFO L226 Difference]: Without dead ends: 587 [2021-12-06 21:57:58,597 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-12-06 21:57:58,598 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 53 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2021-12-06 21:57:58,599 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.2s Time] [2021-12-06 21:57:58,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2021-12-06 21:57:58,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 535. [2021-12-06 21:57:58,625 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-12-06 21:57:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 661 transitions. [2021-12-06 21:57:58,629 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 661 transitions. Word has length 51 [2021-12-06 21:57:58,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:57:58,629 INFO L470 AbstractCegarLoop]: Abstraction has 535 states and 661 transitions. [2021-12-06 21:57:58,629 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-12-06 21:57:58,629 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 661 transitions. [2021-12-06 21:57:58,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-06 21:57:58,631 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:57:58,631 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-12-06 21:57:58,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 21:57:58,631 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:57:58,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:57:58,632 INFO L85 PathProgramCache]: Analyzing trace with hash 748380995, now seen corresponding path program 1 times [2021-12-06 21:57:58,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:57:58,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567882482] [2021-12-06 21:57:58,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:57:58,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:57:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:58,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:57:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:58,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 21:57:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:58,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:57:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:58,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-06 21:57:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:58,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:57:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 21:57:58,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:57:58,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567882482] [2021-12-06 21:57:58,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567882482] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:57:58,740 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:57:58,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 21:57:58,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623959023] [2021-12-06 21:57:58,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:57:58,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:57:58,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:57:58,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:57:58,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 21:57:58,742 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-12-06 21:57:58,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:57:58,958 INFO L93 Difference]: Finished difference Result 1233 states and 1565 transitions. [2021-12-06 21:57:58,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 21:57:58,959 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-12-06 21:57:58,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:57:58,964 INFO L225 Difference]: With dead ends: 1233 [2021-12-06 21:57:58,964 INFO L226 Difference]: Without dead ends: 709 [2021-12-06 21:57:58,966 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-12-06 21:57:58,966 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 206 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2021-12-06 21:57:58,967 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.2s Time] [2021-12-06 21:57:58,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-12-06 21:57:58,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 606. [2021-12-06 21:57:58,993 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-12-06 21:57:58,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 762 transitions. [2021-12-06 21:57:58,997 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 762 transitions. Word has length 51 [2021-12-06 21:57:58,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:57:58,997 INFO L470 AbstractCegarLoop]: Abstraction has 606 states and 762 transitions. [2021-12-06 21:57:58,997 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-12-06 21:57:58,997 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 762 transitions. [2021-12-06 21:57:58,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-06 21:57:58,999 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:57:58,999 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-12-06 21:57:58,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 21:57:59,000 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:57:59,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:57:59,000 INFO L85 PathProgramCache]: Analyzing trace with hash -38243739, now seen corresponding path program 1 times [2021-12-06 21:57:59,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:57:59,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281248639] [2021-12-06 21:57:59,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:57:59,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:57:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:59,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:57:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:59,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 21:57:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:59,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:57:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:59,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 21:57:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:59,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:57:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:59,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-06 21:57:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:59,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:57:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:59,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 21:57:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:59,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:57:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:59,225 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-06 21:57:59,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:57:59,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281248639] [2021-12-06 21:57:59,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281248639] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:57:59,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403047256] [2021-12-06 21:57:59,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:57:59,226 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:57:59,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:57:59,227 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:57:59,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 21:57:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:57:59,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-06 21:57:59,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:57:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 21:57:59,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:57:59,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403047256] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:57:59,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:57:59,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2021-12-06 21:57:59,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315354690] [2021-12-06 21:57:59,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:57:59,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 21:57:59,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:57:59,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 21:57:59,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-12-06 21:57:59,600 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-12-06 21:57:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:57:59,647 INFO L93 Difference]: Finished difference Result 1189 states and 1524 transitions. [2021-12-06 21:57:59,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 21:57:59,648 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-12-06 21:57:59,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:57:59,652 INFO L225 Difference]: With dead ends: 1189 [2021-12-06 21:57:59,652 INFO L226 Difference]: Without dead ends: 596 [2021-12-06 21:57:59,654 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-12-06 21:57:59,655 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-12-06 21:57:59,656 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-12-06 21:57:59,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-12-06 21:57:59,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 426. [2021-12-06 21:57:59,680 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-12-06 21:57:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 528 transitions. [2021-12-06 21:57:59,683 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 528 transitions. Word has length 86 [2021-12-06 21:57:59,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:57:59,683 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 528 transitions. [2021-12-06 21:57:59,683 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-12-06 21:57:59,683 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 528 transitions. [2021-12-06 21:57:59,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-06 21:57:59,685 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:57:59,685 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-12-06 21:57:59,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 21:57:59,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:57:59,887 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:57:59,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:57:59,888 INFO L85 PathProgramCache]: Analyzing trace with hash 2068539649, now seen corresponding path program 1 times [2021-12-06 21:57:59,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:57:59,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653241513] [2021-12-06 21:57:59,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:57:59,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:58:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:00,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:58:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:00,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 21:58:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:00,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:00,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 21:58:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:00,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:00,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-06 21:58:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:00,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:00,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 21:58:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:00,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 21:58:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:00,223 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-06 21:58:00,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:58:00,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653241513] [2021-12-06 21:58:00,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653241513] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:58:00,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268975081] [2021-12-06 21:58:00,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:00,224 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:00,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:58:00,225 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:58:00,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 21:58:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:00,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-06 21:58:00,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:58:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-06 21:58:00,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:58:00,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268975081] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:58:00,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:58:00,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2021-12-06 21:58:00,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765747593] [2021-12-06 21:58:00,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:58:00,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 21:58:00,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:58:00,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 21:58:00,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2021-12-06 21:58:00,587 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-12-06 21:58:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:58:00,682 INFO L93 Difference]: Finished difference Result 906 states and 1163 transitions. [2021-12-06 21:58:00,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 21:58:00,682 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-12-06 21:58:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:58:00,686 INFO L225 Difference]: With dead ends: 906 [2021-12-06 21:58:00,686 INFO L226 Difference]: Without dead ends: 596 [2021-12-06 21:58:00,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2021-12-06 21:58:00,688 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 185 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:58:00,688 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.0s Time] [2021-12-06 21:58:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-12-06 21:58:00,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 426. [2021-12-06 21:58:00,706 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-12-06 21:58:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 526 transitions. [2021-12-06 21:58:00,709 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 526 transitions. Word has length 83 [2021-12-06 21:58:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:58:00,709 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 526 transitions. [2021-12-06 21:58:00,709 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-12-06 21:58:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 526 transitions. [2021-12-06 21:58:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-06 21:58:00,710 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:58:00,710 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-12-06 21:58:00,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 21:58:00,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:00,911 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:58:00,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:58:00,912 INFO L85 PathProgramCache]: Analyzing trace with hash 23795875, now seen corresponding path program 1 times [2021-12-06 21:58:00,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:58:00,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386570049] [2021-12-06 21:58:00,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:00,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:58:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:01,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:58:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:01,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 21:58:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:01,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:01,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 21:58:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:01,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:01,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-06 21:58:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:01,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:01,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 21:58:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:01,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:01,143 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-06 21:58:01,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:58:01,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386570049] [2021-12-06 21:58:01,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386570049] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:58:01,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789963931] [2021-12-06 21:58:01,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:01,144 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:01,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:58:01,145 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:58:01,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 21:58:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:01,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 21:58:01,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:58:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 21:58:01,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:58:01,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789963931] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:58:01,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:58:01,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2021-12-06 21:58:01,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730951620] [2021-12-06 21:58:01,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:58:01,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 21:58:01,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:58:01,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 21:58:01,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-06 21:58:01,519 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-12-06 21:58:01,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:58:01,641 INFO L93 Difference]: Finished difference Result 661 states and 817 transitions. [2021-12-06 21:58:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 21:58:01,641 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-12-06 21:58:01,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:58:01,646 INFO L225 Difference]: With dead ends: 661 [2021-12-06 21:58:01,646 INFO L226 Difference]: Without dead ends: 658 [2021-12-06 21:58:01,647 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-12-06 21:58:01,647 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-12-06 21:58:01,648 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-12-06 21:58:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2021-12-06 21:58:01,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 636. [2021-12-06 21:58:01,685 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-12-06 21:58:01,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 791 transitions. [2021-12-06 21:58:01,689 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 791 transitions. Word has length 86 [2021-12-06 21:58:01,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:58:01,690 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 791 transitions. [2021-12-06 21:58:01,690 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-12-06 21:58:01,690 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 791 transitions. [2021-12-06 21:58:01,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-12-06 21:58:01,692 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:58:01,692 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-12-06 21:58:01,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 21:58:01,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:01,893 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:58:01,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:58:01,893 INFO L85 PathProgramCache]: Analyzing trace with hash -170270410, now seen corresponding path program 1 times [2021-12-06 21:58:01,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:58:01,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576774888] [2021-12-06 21:58:01,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:01,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:58:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:01,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:58:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:01,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 21:58:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:01,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:01,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 21:58:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:02,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:02,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-06 21:58:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:02,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-06 21:58:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:02,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:02,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-06 21:58:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:02,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:02,033 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 21:58:02,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:58:02,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576774888] [2021-12-06 21:58:02,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576774888] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:58:02,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 21:58:02,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 21:58:02,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24752039] [2021-12-06 21:58:02,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:58:02,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 21:58:02,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:58:02,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 21:58:02,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-06 21:58:02,035 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-12-06 21:58:02,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:58:02,291 INFO L93 Difference]: Finished difference Result 1320 states and 1645 transitions. [2021-12-06 21:58:02,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 21:58:02,291 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-12-06 21:58:02,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:58:02,294 INFO L225 Difference]: With dead ends: 1320 [2021-12-06 21:58:02,294 INFO L226 Difference]: Without dead ends: 685 [2021-12-06 21:58:02,296 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-12-06 21:58:02,296 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.2s IncrementalHoareTripleChecker+Time [2021-12-06 21:58:02,297 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.2s Time] [2021-12-06 21:58:02,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2021-12-06 21:58:02,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 596. [2021-12-06 21:58:02,323 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-12-06 21:58:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 743 transitions. [2021-12-06 21:58:02,326 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 743 transitions. Word has length 96 [2021-12-06 21:58:02,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:58:02,327 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 743 transitions. [2021-12-06 21:58:02,327 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-12-06 21:58:02,327 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 743 transitions. [2021-12-06 21:58:02,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-06 21:58:02,328 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:58:02,328 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-12-06 21:58:02,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 21:58:02,328 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:58:02,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:58:02,328 INFO L85 PathProgramCache]: Analyzing trace with hash 320363955, now seen corresponding path program 1 times [2021-12-06 21:58:02,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:58:02,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906577280] [2021-12-06 21:58:02,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:02,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:58:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:02,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:58:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:02,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 21:58:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:02,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:02,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 21:58:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:02,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:02,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-06 21:58:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:02,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:02,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 21:58:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:02,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:02,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 21:58:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:02,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-06 21:58:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:02,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 21:58:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:02,536 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-06 21:58:02,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:58:02,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906577280] [2021-12-06 21:58:02,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906577280] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:58:02,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557919675] [2021-12-06 21:58:02,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:02,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:02,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:58:02,537 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:58:02,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 21:58:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:02,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-06 21:58:02,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:58:03,543 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-12-06 21:58:03,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-06 21:58:03,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2021-12-06 21:58:03,661 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-06 21:58:03,662 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-12-06 21:58:03,674 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 25 treesize of output 17 [2021-12-06 21:58:03,677 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-12-06 21:58:03,744 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 21:58:03,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:58:03,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557919675] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:58:03,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:58:03,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2021-12-06 21:58:03,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54790920] [2021-12-06 21:58:03,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:58:03,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 21:58:03,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:58:03,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 21:58:03,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=241, Unknown=1, NotChecked=30, Total=306 [2021-12-06 21:58:03,746 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-12-06 21:58:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:58:04,291 INFO L93 Difference]: Finished difference Result 702 states and 868 transitions. [2021-12-06 21:58:04,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 21:58:04,292 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-12-06 21:58:04,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:58:04,296 INFO L225 Difference]: With dead ends: 702 [2021-12-06 21:58:04,296 INFO L226 Difference]: Without dead ends: 661 [2021-12-06 21:58:04,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=303, Unknown=1, NotChecked=34, Total=380 [2021-12-06 21:58:04,298 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 24 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2021-12-06 21:58:04,298 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.5s Time] [2021-12-06 21:58:04,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2021-12-06 21:58:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 628. [2021-12-06 21:58:04,335 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-12-06 21:58:04,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 785 transitions. [2021-12-06 21:58:04,339 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 785 transitions. Word has length 105 [2021-12-06 21:58:04,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:58:04,340 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 785 transitions. [2021-12-06 21:58:04,340 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-12-06 21:58:04,340 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 785 transitions. [2021-12-06 21:58:04,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-06 21:58:04,342 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:58:04,342 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-12-06 21:58:04,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 21:58:04,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:04,543 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:58:04,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:58:04,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1953167954, now seen corresponding path program 1 times [2021-12-06 21:58:04,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:58:04,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112299032] [2021-12-06 21:58:04,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:04,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:58:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:04,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:58:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:04,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 21:58:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:04,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:04,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 21:58:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:04,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:04,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-06 21:58:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:04,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:04,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 21:58:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:04,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:04,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 21:58:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:04,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-06 21:58:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:04,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 21:58:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:04,768 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-06 21:58:04,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:58:04,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112299032] [2021-12-06 21:58:04,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112299032] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:58:04,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545422804] [2021-12-06 21:58:04,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:04,769 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:04,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:58:04,770 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:58:04,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 21:58:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:05,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-06 21:58:05,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:58:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-06 21:58:05,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:58:05,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545422804] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:58:05,140 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:58:05,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2021-12-06 21:58:05,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511867415] [2021-12-06 21:58:05,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:58:05,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 21:58:05,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:58:05,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 21:58:05,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2021-12-06 21:58:05,142 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-12-06 21:58:05,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:58:05,271 INFO L93 Difference]: Finished difference Result 1390 states and 1777 transitions. [2021-12-06 21:58:05,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 21:58:05,272 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-12-06 21:58:05,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:58:05,277 INFO L225 Difference]: With dead ends: 1390 [2021-12-06 21:58:05,277 INFO L226 Difference]: Without dead ends: 810 [2021-12-06 21:58:05,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2021-12-06 21:58:05,279 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 145 mSDsluCounter, 1869 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-06 21:58:05,279 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-12-06 21:58:05,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2021-12-06 21:58:05,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 628. [2021-12-06 21:58:05,305 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-12-06 21:58:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 781 transitions. [2021-12-06 21:58:05,309 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 781 transitions. Word has length 105 [2021-12-06 21:58:05,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:58:05,309 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 781 transitions. [2021-12-06 21:58:05,309 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-12-06 21:58:05,309 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 781 transitions. [2021-12-06 21:58:05,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-06 21:58:05,310 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:58:05,311 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-12-06 21:58:05,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 21:58:05,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:05,511 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:58:05,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:58:05,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1044819566, now seen corresponding path program 1 times [2021-12-06 21:58:05,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:58:05,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433007932] [2021-12-06 21:58:05,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:05,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:58:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:05,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:58:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:05,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 21:58:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:05,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:05,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 21:58:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:05,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:05,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-06 21:58:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:05,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:05,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 21:58:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:05,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:05,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 21:58:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:05,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 21:58:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:05,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 21:58:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:05,710 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-06 21:58:05,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:58:05,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433007932] [2021-12-06 21:58:05,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433007932] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:58:05,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718515083] [2021-12-06 21:58:05,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:05,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:05,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:58:05,712 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:58:05,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-06 21:58:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:05,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-06 21:58:05,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:58:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-06 21:58:06,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:58:06,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718515083] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:58:06,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:58:06,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 18 [2021-12-06 21:58:06,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503785953] [2021-12-06 21:58:06,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:58:06,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 21:58:06,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:58:06,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 21:58:06,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2021-12-06 21:58:06,172 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-12-06 21:58:06,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:58:06,269 INFO L93 Difference]: Finished difference Result 1262 states and 1579 transitions. [2021-12-06 21:58:06,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 21:58:06,270 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-12-06 21:58:06,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:58:06,273 INFO L225 Difference]: With dead ends: 1262 [2021-12-06 21:58:06,273 INFO L226 Difference]: Without dead ends: 677 [2021-12-06 21:58:06,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2021-12-06 21:58:06,275 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.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:58:06,275 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.0s Time] [2021-12-06 21:58:06,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2021-12-06 21:58:06,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 648. [2021-12-06 21:58:06,302 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-12-06 21:58:06,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 805 transitions. [2021-12-06 21:58:06,305 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 805 transitions. Word has length 107 [2021-12-06 21:58:06,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:58:06,305 INFO L470 AbstractCegarLoop]: Abstraction has 648 states and 805 transitions. [2021-12-06 21:58:06,306 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-12-06 21:58:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 805 transitions. [2021-12-06 21:58:06,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-06 21:58:06,307 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:58:06,307 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-12-06 21:58:06,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-06 21:58:06,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:06,507 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:58:06,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:58:06,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1482829069, now seen corresponding path program 1 times [2021-12-06 21:58:06,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:58:06,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303466221] [2021-12-06 21:58:06,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:06,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:58:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:06,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:58:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:06,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 21:58:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:06,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:06,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 21:58:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:06,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:06,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-06 21:58:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:06,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:06,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 21:58:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:06,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:06,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 21:58:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:06,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 21:58:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:06,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 21:58:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:06,709 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-06 21:58:06,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:58:06,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303466221] [2021-12-06 21:58:06,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303466221] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:58:06,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856248315] [2021-12-06 21:58:06,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:06,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:06,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:58:06,710 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:58:06,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-06 21:58:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:06,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-06 21:58:06,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:58:07,125 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-06 21:58:07,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:58:07,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856248315] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:58:07,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:58:07,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2021-12-06 21:58:07,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386412459] [2021-12-06 21:58:07,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:58:07,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 21:58:07,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:58:07,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 21:58:07,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2021-12-06 21:58:07,127 INFO L87 Difference]: Start difference. First operand 648 states and 805 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 7 states have internal predecessors, (71), 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-12-06 21:58:07,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:58:07,218 INFO L93 Difference]: Finished difference Result 856 states and 1088 transitions. [2021-12-06 21:58:07,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 21:58:07,219 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 7 states have internal predecessors, (71), 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 107 [2021-12-06 21:58:07,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:58:07,222 INFO L225 Difference]: With dead ends: 856 [2021-12-06 21:58:07,222 INFO L226 Difference]: Without dead ends: 821 [2021-12-06 21:58:07,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2021-12-06 21:58:07,224 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 186 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:58:07,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 1935 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:58:07,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2021-12-06 21:58:07,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 648. [2021-12-06 21:58:07,253 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-12-06 21:58:07,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 805 transitions. [2021-12-06 21:58:07,255 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 805 transitions. Word has length 107 [2021-12-06 21:58:07,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:58:07,256 INFO L470 AbstractCegarLoop]: Abstraction has 648 states and 805 transitions. [2021-12-06 21:58:07,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 7 states have internal predecessors, (71), 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-12-06 21:58:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 805 transitions. [2021-12-06 21:58:07,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-12-06 21:58:07,257 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:58:07,257 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-12-06 21:58:07,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-06 21:58:07,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:07,458 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:58:07,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:58:07,458 INFO L85 PathProgramCache]: Analyzing trace with hash 966922471, now seen corresponding path program 1 times [2021-12-06 21:58:07,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:58:07,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113320612] [2021-12-06 21:58:07,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:07,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:58:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:07,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:58:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:07,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 21:58:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:07,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:07,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 21:58:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:07,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:07,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-06 21:58:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:07,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:07,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 21:58:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:07,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:07,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-06 21:58:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:07,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 21:58:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:07,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-12-06 21:58:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-06 21:58:07,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:58:07,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113320612] [2021-12-06 21:58:07,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113320612] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:58:07,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122200102] [2021-12-06 21:58:07,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:07,646 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:07,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:58:07,647 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:58:07,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-06 21:58:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:07,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 21:58:07,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:58:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-06 21:58:08,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 21:58:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-06 21:58:08,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122200102] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-06 21:58:08,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-06 21:58:08,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12, 5] total 17 [2021-12-06 21:58:08,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099252009] [2021-12-06 21:58:08,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:58:08,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:58:08,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:58:08,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:58:08,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-12-06 21:58:08,183 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-12-06 21:58:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:58:08,501 INFO L93 Difference]: Finished difference Result 1874 states and 2335 transitions. [2021-12-06 21:58:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 21:58:08,502 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-12-06 21:58:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:58:08,509 INFO L225 Difference]: With dead ends: 1874 [2021-12-06 21:58:08,509 INFO L226 Difference]: Without dead ends: 1250 [2021-12-06 21:58:08,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-12-06 21:58:08,512 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 359 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 21:58:08,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 689 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 21:58:08,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2021-12-06 21:58:08,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1210. [2021-12-06 21:58:08,587 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-12-06 21:58:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1504 transitions. [2021-12-06 21:58:08,593 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1504 transitions. Word has length 108 [2021-12-06 21:58:08,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:58:08,594 INFO L470 AbstractCegarLoop]: Abstraction has 1210 states and 1504 transitions. [2021-12-06 21:58:08,594 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-12-06 21:58:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1504 transitions. [2021-12-06 21:58:08,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-06 21:58:08,595 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:58:08,596 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-12-06 21:58:08,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-06 21:58:08,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-06 21:58:08,796 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:58:08,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:58:08,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1819211607, now seen corresponding path program 1 times [2021-12-06 21:58:08,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:58:08,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991693241] [2021-12-06 21:58:08,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:08,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:58:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:08,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:58:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:08,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 21:58:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:08,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:08,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 21:58:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:08,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:08,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-06 21:58:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:08,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:08,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 21:58:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:08,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:08,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-06 21:58:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:08,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-06 21:58:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:09,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-06 21:58:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:09,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 21:58:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:09,012 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-06 21:58:09,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:58:09,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991693241] [2021-12-06 21:58:09,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991693241] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:58:09,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480379791] [2021-12-06 21:58:09,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:09,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:09,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:58:09,013 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:58:09,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-06 21:58:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:09,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 1777 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-06 21:58:09,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:58:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-06 21:58:09,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:58:09,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480379791] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:58:09,433 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:58:09,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2021-12-06 21:58:09,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878269747] [2021-12-06 21:58:09,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:58:09,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 21:58:09,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:58:09,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 21:58:09,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-12-06 21:58:09,434 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-12-06 21:58:09,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:58:09,479 INFO L93 Difference]: Finished difference Result 1861 states and 2314 transitions. [2021-12-06 21:58:09,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 21:58:09,479 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-12-06 21:58:09,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:58:09,484 INFO L225 Difference]: With dead ends: 1861 [2021-12-06 21:58:09,484 INFO L226 Difference]: Without dead ends: 697 [2021-12-06 21:58:09,486 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-12-06 21:58:09,487 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-12-06 21:58:09,488 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-12-06 21:58:09,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2021-12-06 21:58:09,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 667. [2021-12-06 21:58:09,533 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-12-06 21:58:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 823 transitions. [2021-12-06 21:58:09,537 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 823 transitions. Word has length 116 [2021-12-06 21:58:09,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:58:09,537 INFO L470 AbstractCegarLoop]: Abstraction has 667 states and 823 transitions. [2021-12-06 21:58:09,537 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-12-06 21:58:09,538 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 823 transitions. [2021-12-06 21:58:09,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-12-06 21:58:09,539 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:58:09,539 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-12-06 21:58:09,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-06 21:58:09,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-06 21:58:09,741 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:58:09,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:58:09,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2067358101, now seen corresponding path program 1 times [2021-12-06 21:58:09,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:58:09,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041388561] [2021-12-06 21:58:09,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:09,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:58:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:09,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:58:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:09,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 21:58:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:09,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:09,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 21:58:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:09,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:09,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-06 21:58:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:09,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:09,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 21:58:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:09,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:09,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-06 21:58:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:09,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-06 21:58:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:09,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-06 21:58:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:09,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 21:58:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-06 21:58:09,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:58:09,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041388561] [2021-12-06 21:58:09,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041388561] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:58:09,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983460975] [2021-12-06 21:58:09,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:09,973 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:09,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:58:09,974 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:58:09,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-06 21:58:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:10,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 1776 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 21:58:10,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:58:10,447 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-06 21:58:10,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:58:10,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983460975] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:58:10,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:58:10,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2021-12-06 21:58:10,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473957371] [2021-12-06 21:58:10,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:58:10,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 21:58:10,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:58:10,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 21:58:10,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-06 21:58:10,448 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-12-06 21:58:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:58:10,550 INFO L93 Difference]: Finished difference Result 1213 states and 1506 transitions. [2021-12-06 21:58:10,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 21:58:10,551 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-12-06 21:58:10,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:58:10,556 INFO L225 Difference]: With dead ends: 1213 [2021-12-06 21:58:10,556 INFO L226 Difference]: Without dead ends: 1208 [2021-12-06 21:58:10,557 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-12-06 21:58:10,558 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 247 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 21:58:10,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 339 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:58:10,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2021-12-06 21:58:10,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1176. [2021-12-06 21:58:10,607 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-12-06 21:58:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1466 transitions. [2021-12-06 21:58:10,612 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1466 transitions. Word has length 116 [2021-12-06 21:58:10,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:58:10,612 INFO L470 AbstractCegarLoop]: Abstraction has 1176 states and 1466 transitions. [2021-12-06 21:58:10,612 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-12-06 21:58:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1466 transitions. [2021-12-06 21:58:10,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-12-06 21:58:10,613 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:58:10,613 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-12-06 21:58:10,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-06 21:58:10,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-06 21:58:10,814 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:58:10,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:58:10,814 INFO L85 PathProgramCache]: Analyzing trace with hash 541721343, now seen corresponding path program 1 times [2021-12-06 21:58:10,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:58:10,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924163139] [2021-12-06 21:58:10,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:10,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:58:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:10,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:58:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:10,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 21:58:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:10,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:10,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 21:58:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:10,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:10,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-06 21:58:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:10,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:10,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 21:58:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:10,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-06 21:58:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-06 21:58:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-06 21:58:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 21:58:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-06 21:58:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-06 21:58:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,019 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-06 21:58:11,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:58:11,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924163139] [2021-12-06 21:58:11,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924163139] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:58:11,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557009948] [2021-12-06 21:58:11,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:11,020 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:11,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:58:11,021 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:58:11,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-06 21:58:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 1832 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 21:58:11,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:58:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-06 21:58:11,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:58:11,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557009948] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:58:11,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:58:11,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2021-12-06 21:58:11,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825442464] [2021-12-06 21:58:11,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:58:11,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 21:58:11,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:58:11,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 21:58:11,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2021-12-06 21:58:11,441 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-12-06 21:58:11,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:58:11,506 INFO L93 Difference]: Finished difference Result 1368 states and 1732 transitions. [2021-12-06 21:58:11,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 21:58:11,507 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-12-06 21:58:11,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:58:11,514 INFO L225 Difference]: With dead ends: 1368 [2021-12-06 21:58:11,514 INFO L226 Difference]: Without dead ends: 1358 [2021-12-06 21:58:11,514 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-12-06 21:58:11,515 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 213 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:58:11,515 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.0s Time] [2021-12-06 21:58:11,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2021-12-06 21:58:11,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1182. [2021-12-06 21:58:11,571 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-12-06 21:58:11,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1472 transitions. [2021-12-06 21:58:11,573 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1472 transitions. Word has length 129 [2021-12-06 21:58:11,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:58:11,574 INFO L470 AbstractCegarLoop]: Abstraction has 1182 states and 1472 transitions. [2021-12-06 21:58:11,574 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-12-06 21:58:11,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1472 transitions. [2021-12-06 21:58:11,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-12-06 21:58:11,575 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:58:11,575 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-12-06 21:58:11,611 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-06 21:58:11,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-06 21:58:11,776 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:58:11,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:58:11,776 INFO L85 PathProgramCache]: Analyzing trace with hash -554191626, now seen corresponding path program 1 times [2021-12-06 21:58:11,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:58:11,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939797758] [2021-12-06 21:58:11,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:11,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:58:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:58:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 21:58:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 21:58:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-06 21:58:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 21:58:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-06 21:58:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-06 21:58:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-06 21:58:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 21:58:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-06 21:58:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-06 21:58:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:11,982 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-12-06 21:58:11,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:58:11,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939797758] [2021-12-06 21:58:11,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939797758] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:58:11,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149088233] [2021-12-06 21:58:11,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:11,983 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:11,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:58:11,983 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:58:11,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-06 21:58:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:12,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 1844 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 21:58:12,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:58:12,463 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-06 21:58:12,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:58:12,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149088233] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:58:12,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:58:12,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2021-12-06 21:58:12,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886156164] [2021-12-06 21:58:12,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:58:12,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-06 21:58:12,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:58:12,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-06 21:58:12,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-06 21:58:12,464 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-12-06 21:58:12,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:58:12,528 INFO L93 Difference]: Finished difference Result 2302 states and 2876 transitions. [2021-12-06 21:58:12,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-06 21:58:12,529 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-12-06 21:58:12,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:58:12,533 INFO L225 Difference]: With dead ends: 2302 [2021-12-06 21:58:12,533 INFO L226 Difference]: Without dead ends: 1110 [2021-12-06 21:58:12,535 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-12-06 21:58:12,536 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 46 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:58:12,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 423 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 21:58:12,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2021-12-06 21:58:12,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2021-12-06 21:58:12,600 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-12-06 21:58:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1336 transitions. [2021-12-06 21:58:12,603 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1336 transitions. Word has length 133 [2021-12-06 21:58:12,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:58:12,603 INFO L470 AbstractCegarLoop]: Abstraction has 1110 states and 1336 transitions. [2021-12-06 21:58:12,603 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-12-06 21:58:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1336 transitions. [2021-12-06 21:58:12,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-12-06 21:58:12,604 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:58:12,604 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-12-06 21:58:12,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-06 21:58:12,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:12,806 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:58:12,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:58:12,806 INFO L85 PathProgramCache]: Analyzing trace with hash 78838695, now seen corresponding path program 1 times [2021-12-06 21:58:12,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:58:12,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860634556] [2021-12-06 21:58:12,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:12,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:58:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:12,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:58:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:12,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 21:58:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:12,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:12,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 21:58:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:12,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:12,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-06 21:58:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:12,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:12,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 21:58:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:12,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:12,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-06 21:58:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:13,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-06 21:58:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:13,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-06 21:58:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:13,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 21:58:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:13,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-06 21:58:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:13,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-06 21:58:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:13,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-06 21:58:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:13,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-06 21:58:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:13,035 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-06 21:58:13,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:58:13,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860634556] [2021-12-06 21:58:13,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860634556] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:58:13,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928718580] [2021-12-06 21:58:13,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:13,036 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:13,036 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:58:13,037 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:58:13,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-06 21:58:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:13,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 1876 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-06 21:58:13,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:58:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-12-06 21:58:13,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:58:13,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928718580] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:58:13,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:58:13,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2021-12-06 21:58:13,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583356186] [2021-12-06 21:58:13,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:58:13,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 21:58:13,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:58:13,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 21:58:13,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2021-12-06 21:58:13,591 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-12-06 21:58:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:58:13,715 INFO L93 Difference]: Finished difference Result 2194 states and 2647 transitions. [2021-12-06 21:58:13,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 21:58:13,716 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-12-06 21:58:13,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:58:13,721 INFO L225 Difference]: With dead ends: 2194 [2021-12-06 21:58:13,721 INFO L226 Difference]: Without dead ends: 1139 [2021-12-06 21:58:13,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2021-12-06 21:58:13,724 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.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:58:13,724 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.0s Time] [2021-12-06 21:58:13,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2021-12-06 21:58:13,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1110. [2021-12-06 21:58:13,776 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-12-06 21:58:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1331 transitions. [2021-12-06 21:58:13,778 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1331 transitions. Word has length 144 [2021-12-06 21:58:13,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:58:13,779 INFO L470 AbstractCegarLoop]: Abstraction has 1110 states and 1331 transitions. [2021-12-06 21:58:13,779 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-12-06 21:58:13,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1331 transitions. [2021-12-06 21:58:13,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2021-12-06 21:58:13,780 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:58:13,780 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-12-06 21:58:13,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-06 21:58:13,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-06 21:58:13,980 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:58:13,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:58:13,981 INFO L85 PathProgramCache]: Analyzing trace with hash 92371496, now seen corresponding path program 2 times [2021-12-06 21:58:13,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:58:13,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233550402] [2021-12-06 21:58:13,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:13,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:58:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:14,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:58:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:14,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 21:58:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:14,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:14,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 21:58:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:14,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:14,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-06 21:58:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:14,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:14,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 21:58:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:14,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:14,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-06 21:58:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:14,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-06 21:58:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:14,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-06 21:58:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:14,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 21:58:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:14,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-06 21:58:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:14,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-06 21:58:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:14,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-06 21:58:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:14,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-06 21:58:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:14,172 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-06 21:58:14,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:58:14,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233550402] [2021-12-06 21:58:14,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233550402] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:58:14,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388917460] [2021-12-06 21:58:14,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 21:58:14,173 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:14,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:58:14,173 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:58:14,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-06 21:58:14,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-06 21:58:14,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:58:14,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 1577 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 21:58:14,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:58:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-06 21:58:14,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:58:14,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388917460] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:58:14,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:58:14,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2021-12-06 21:58:14,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038420743] [2021-12-06 21:58:14,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:58:14,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 21:58:14,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:58:14,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 21:58:14,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-12-06 21:58:14,660 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-12-06 21:58:14,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:58:14,691 INFO L93 Difference]: Finished difference Result 1765 states and 2122 transitions. [2021-12-06 21:58:14,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 21:58:14,691 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-12-06 21:58:14,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:58:14,694 INFO L225 Difference]: With dead ends: 1765 [2021-12-06 21:58:14,694 INFO L226 Difference]: Without dead ends: 717 [2021-12-06 21:58:14,696 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-12-06 21:58:14,696 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-12-06 21:58:14,697 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-12-06 21:58:14,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2021-12-06 21:58:14,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 713. [2021-12-06 21:58:14,727 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-12-06 21:58:14,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 840 transitions. [2021-12-06 21:58:14,728 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 840 transitions. Word has length 144 [2021-12-06 21:58:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:58:14,729 INFO L470 AbstractCegarLoop]: Abstraction has 713 states and 840 transitions. [2021-12-06 21:58:14,729 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-12-06 21:58:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 840 transitions. [2021-12-06 21:58:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-12-06 21:58:14,730 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:58:14,730 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-12-06 21:58:14,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-06 21:58:14,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:14,931 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:58:14,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:58:14,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1279560877, now seen corresponding path program 1 times [2021-12-06 21:58:14,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:58:14,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064372103] [2021-12-06 21:58:14,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:14,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:58:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:15,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:58:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:15,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 21:58:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:15,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:15,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 21:58:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:15,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:15,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-06 21:58:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:15,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:15,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 21:58:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:15,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:15,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-06 21:58:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:15,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-06 21:58:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:15,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-06 21:58:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:15,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 21:58:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:15,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-06 21:58:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:15,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-06 21:58:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:15,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-06 21:58:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:15,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-06 21:58:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:15,160 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-06 21:58:15,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:58:15,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064372103] [2021-12-06 21:58:15,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064372103] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:58:15,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718842941] [2021-12-06 21:58:15,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:15,160 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:15,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:58:15,161 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:58:15,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-06 21:58:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:15,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 1885 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 21:58:15,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:58:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-06 21:58:15,679 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:58:15,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718842941] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:58:15,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:58:15,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2021-12-06 21:58:15,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323170285] [2021-12-06 21:58:15,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:58:15,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 21:58:15,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:58:15,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 21:58:15,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-12-06 21:58:15,681 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-12-06 21:58:15,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:58:15,906 INFO L93 Difference]: Finished difference Result 1338 states and 1585 transitions. [2021-12-06 21:58:15,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 21:58:15,907 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-12-06 21:58:15,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:58:15,909 INFO L225 Difference]: With dead ends: 1338 [2021-12-06 21:58:15,909 INFO L226 Difference]: Without dead ends: 653 [2021-12-06 21:58:15,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-12-06 21:58:15,911 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 149 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2021-12-06 21:58:15,911 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.2s Time] [2021-12-06 21:58:15,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2021-12-06 21:58:15,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 596. [2021-12-06 21:58:15,937 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-12-06 21:58:15,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 703 transitions. [2021-12-06 21:58:15,938 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 703 transitions. Word has length 146 [2021-12-06 21:58:15,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:58:15,938 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 703 transitions. [2021-12-06 21:58:15,939 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-12-06 21:58:15,939 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 703 transitions. [2021-12-06 21:58:15,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-06 21:58:15,939 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:58:15,939 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-12-06 21:58:15,962 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-12-06 21:58:16,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:16,141 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:58:16,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:58:16,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1011559813, now seen corresponding path program 1 times [2021-12-06 21:58:16,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:58:16,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533563638] [2021-12-06 21:58:16,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:16,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:58:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:16,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:58:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:16,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 21:58:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:16,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:16,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 21:58:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:16,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:16,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-06 21:58:16,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:16,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:16,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 21:58:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:16,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:16,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-06 21:58:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:16,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-06 21:58:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:16,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-06 21:58:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:16,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 21:58:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:16,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-06 21:58:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:16,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-06 21:58:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:16,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-06 21:58:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:16,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-06 21:58:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-06 21:58:16,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:58:16,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533563638] [2021-12-06 21:58:16,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533563638] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:58:16,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827020596] [2021-12-06 21:58:16,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:16,360 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:16,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:58:16,361 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:58:16,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-06 21:58:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:16,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 1887 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-06 21:58:16,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:58:16,929 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-12-06 21:58:16,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:58:16,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827020596] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:58:16,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:58:16,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 16 [2021-12-06 21:58:16,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320680365] [2021-12-06 21:58:16,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:58:16,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 21:58:16,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:58:16,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 21:58:16,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-12-06 21:58:16,931 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-12-06 21:58:17,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:58:17,069 INFO L93 Difference]: Finished difference Result 1241 states and 1469 transitions. [2021-12-06 21:58:17,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 21:58:17,069 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-12-06 21:58:17,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:58:17,072 INFO L225 Difference]: With dead ends: 1241 [2021-12-06 21:58:17,072 INFO L226 Difference]: Without dead ends: 673 [2021-12-06 21:58:17,073 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-12-06 21:58:17,073 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 32 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1773 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-12-06 21:58:17,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 1773 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 21:58:17,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2021-12-06 21:58:17,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 633. [2021-12-06 21:58:17,101 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-12-06 21:58:17,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 746 transitions. [2021-12-06 21:58:17,102 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 746 transitions. Word has length 147 [2021-12-06 21:58:17,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:58:17,102 INFO L470 AbstractCegarLoop]: Abstraction has 633 states and 746 transitions. [2021-12-06 21:58:17,102 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-12-06 21:58:17,103 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 746 transitions. [2021-12-06 21:58:17,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-06 21:58:17,103 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:58:17,103 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-12-06 21:58:17,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-06 21:58:17,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:17,305 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:58:17,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:58:17,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2093368100, now seen corresponding path program 2 times [2021-12-06 21:58:17,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:58:17,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200246113] [2021-12-06 21:58:17,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:17,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:58:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:17,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:58:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:17,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 21:58:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:17,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:17,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 21:58:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:17,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:17,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-06 21:58:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:17,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:17,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 21:58:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:17,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:17,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-06 21:58:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:17,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-06 21:58:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:17,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-06 21:58:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:17,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 21:58:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:17,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-06 21:58:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:17,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-06 21:58:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:17,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-06 21:58:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:17,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-06 21:58:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-06 21:58:17,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:58:17,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200246113] [2021-12-06 21:58:17,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200246113] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:58:17,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680334904] [2021-12-06 21:58:17,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 21:58:17,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:17,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:58:17,557 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:58:17,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-06 21:58:17,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-06 21:58:17,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 21:58:17,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 1579 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-06 21:58:17,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:58:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-06 21:58:18,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:58:18,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680334904] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:58:18,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:58:18,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2021-12-06 21:58:18,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698684695] [2021-12-06 21:58:18,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:58:18,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 21:58:18,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:58:18,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 21:58:18,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-12-06 21:58:18,100 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-12-06 21:58:18,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:58:18,112 INFO L93 Difference]: Finished difference Result 660 states and 770 transitions. [2021-12-06 21:58:18,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 21:58:18,113 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-12-06 21:58:18,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:58:18,115 INFO L225 Difference]: With dead ends: 660 [2021-12-06 21:58:18,115 INFO L226 Difference]: Without dead ends: 259 [2021-12-06 21:58:18,116 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-12-06 21:58:18,116 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-12-06 21:58:18,117 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-12-06 21:58:18,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-12-06 21:58:18,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 245. [2021-12-06 21:58:18,127 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-12-06 21:58:18,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 274 transitions. [2021-12-06 21:58:18,127 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 274 transitions. Word has length 147 [2021-12-06 21:58:18,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:58:18,128 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 274 transitions. [2021-12-06 21:58:18,128 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-12-06 21:58:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2021-12-06 21:58:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-12-06 21:58:18,129 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 21:58:18,129 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-12-06 21:58:18,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-06 21:58:18,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-06 21:58:18,330 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 21:58:18,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 21:58:18,331 INFO L85 PathProgramCache]: Analyzing trace with hash 301053376, now seen corresponding path program 1 times [2021-12-06 21:58:18,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 21:58:18,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374470419] [2021-12-06 21:58:18,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:18,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 21:58:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:18,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 21:58:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:18,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-06 21:58:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:18,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:18,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-06 21:58:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:18,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:18,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-06 21:58:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:18,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:18,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 21:58:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:18,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-06 21:58:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:18,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2021-12-06 21:58:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:18,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-06 21:58:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:18,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-06 21:58:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:18,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-06 21:58:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:18,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-06 21:58:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:18,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-06 21:58:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:18,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-06 21:58:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:18,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 21:58:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:18,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:18,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2021-12-06 21:58:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:18,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 21:58:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-06 21:58:18,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 21:58:18,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374470419] [2021-12-06 21:58:18,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374470419] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 21:58:18,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687588829] [2021-12-06 21:58:18,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 21:58:18,591 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:18,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 21:58:18,592 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 21:58:18,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-06 21:58:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 21:58:19,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 2046 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 21:58:19,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 21:58:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-12-06 21:58:19,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 21:58:19,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687588829] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 21:58:19,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-06 21:58:19,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2021-12-06 21:58:19,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251374442] [2021-12-06 21:58:19,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 21:58:19,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 21:58:19,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 21:58:19,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 21:58:19,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-12-06 21:58:19,170 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-12-06 21:58:19,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 21:58:19,233 INFO L93 Difference]: Finished difference Result 251 states and 279 transitions. [2021-12-06 21:58:19,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 21:58:19,234 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-12-06 21:58:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 21:58:19,234 INFO L225 Difference]: With dead ends: 251 [2021-12-06 21:58:19,234 INFO L226 Difference]: Without dead ends: 0 [2021-12-06 21:58:19,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2021-12-06 21:58:19,235 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 36 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2021-12-06 21:58:19,235 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.0s Time] [2021-12-06 21:58:19,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-06 21:58:19,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-06 21:58:19,236 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-12-06 21:58:19,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-06 21:58:19,236 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 177 [2021-12-06 21:58:19,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 21:58:19,236 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-06 21:58:19,236 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-12-06 21:58:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-06 21:58:19,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-06 21:58:19,238 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 21:58:19,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-06 21:58:19,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 21:58:19,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-06 21:58:29,721 WARN L227 SmtUtils]: Spent 8.57s 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-12-06 21:58:40,145 WARN L227 SmtUtils]: Spent 8.60s 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-12-06 21:58:51,333 INFO L861 garLoopResultBuilder]: At program point L4257(lines 4256 4258) the Hoare annotation is: true [2021-12-06 21:58:51,333 INFO L858 garLoopResultBuilder]: For program point kbtab_initEXIT(lines 3909 3925) no Hoare annotation was computed. [2021-12-06 21:58:51,333 INFO L861 garLoopResultBuilder]: At program point L3922(lines 3911 3924) the Hoare annotation is: true [2021-12-06 21:58:51,333 INFO L861 garLoopResultBuilder]: At program point kbtab_initENTRY(lines 3909 3925) the Hoare annotation is: true [2021-12-06 21:58:51,333 INFO L861 garLoopResultBuilder]: At program point L3471(lines 3465 3473) the Hoare annotation is: true [2021-12-06 21:58:51,333 INFO L858 garLoopResultBuilder]: For program point L3915(lines 3915 3918) no Hoare annotation was computed. [2021-12-06 21:58:51,334 INFO L858 garLoopResultBuilder]: For program point kbtab_initFINAL(lines 3909 3925) no Hoare annotation was computed. [2021-12-06 21:58:51,334 INFO L858 garLoopResultBuilder]: For program point L4210-1(line 4210) no Hoare annotation was computed. [2021-12-06 21:58:51,334 INFO L858 garLoopResultBuilder]: For program point dev_get_drvdataFINAL(lines 4209 4211) no Hoare annotation was computed. [2021-12-06 21:58:51,334 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-12-06 21:58:51,334 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-12-06 21:58:51,334 INFO L858 garLoopResultBuilder]: For program point dev_get_drvdataEXIT(lines 4209 4211) no Hoare annotation was computed. [2021-12-06 21:58:51,334 INFO L858 garLoopResultBuilder]: For program point kfreeEXIT(lines 4264 4266) no Hoare annotation was computed. [2021-12-06 21:58:51,334 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-12-06 21:58:51,334 INFO L858 garLoopResultBuilder]: For program point kfreeFINAL(lines 4264 4266) no Hoare annotation was computed. [2021-12-06 21:58:51,335 INFO L858 garLoopResultBuilder]: For program point L3437-1(line 3437) no Hoare annotation was computed. [2021-12-06 21:58:51,335 INFO L861 garLoopResultBuilder]: At program point L3437(line 3437) the Hoare annotation is: true [2021-12-06 21:58:51,335 INFO L861 garLoopResultBuilder]: At program point usb_set_intfdataENTRY(lines 3433 3441) the Hoare annotation is: true [2021-12-06 21:58:51,335 INFO L858 garLoopResultBuilder]: For program point usb_set_intfdataFINAL(lines 3433 3441) no Hoare annotation was computed. [2021-12-06 21:58:51,335 INFO L858 garLoopResultBuilder]: For program point usb_set_intfdataEXIT(lines 3433 3441) no Hoare annotation was computed. [2021-12-06 21:58:51,335 INFO L858 garLoopResultBuilder]: For program point L4239(line 4239) no Hoare annotation was computed. [2021-12-06 21:58:51,335 INFO L858 garLoopResultBuilder]: For program point ldv_undefined_pointerFINAL(lines 4238 4240) no Hoare annotation was computed. [2021-12-06 21:58:51,335 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-12-06 21:58:51,335 INFO L858 garLoopResultBuilder]: For program point ldv_undefined_pointerEXIT(lines 4238 4240) no Hoare annotation was computed. [2021-12-06 21:58:51,336 INFO L861 garLoopResultBuilder]: At program point L4158(line 4158) the Hoare annotation is: true [2021-12-06 21:58:51,336 INFO L858 garLoopResultBuilder]: For program point L4156(lines 4154 4173) no Hoare annotation was computed. [2021-12-06 21:58:51,336 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-12-06 21:58:51,336 INFO L858 garLoopResultBuilder]: For program point usb_free_urbEXIT(lines 4150 4179) no Hoare annotation was computed. [2021-12-06 21:58:51,336 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-12-06 21:58:51,336 INFO L858 garLoopResultBuilder]: For program point L4163(lines 4163 4168) no Hoare annotation was computed. [2021-12-06 21:58:51,336 INFO L858 garLoopResultBuilder]: For program point L4155(lines 4154 4173) no Hoare annotation was computed. [2021-12-06 21:58:51,336 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-12-06 21:58:51,336 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-12-06 21:58:51,337 INFO L858 garLoopResultBuilder]: For program point L4166-1(lines 4163 4168) no Hoare annotation was computed. [2021-12-06 21:58:51,337 INFO L858 garLoopResultBuilder]: For program point input_set_abs_paramsEXIT(lines 4226 4228) no Hoare annotation was computed. [2021-12-06 21:58:51,337 INFO L861 garLoopResultBuilder]: At program point input_set_abs_paramsENTRY(lines 4226 4228) the Hoare annotation is: true [2021-12-06 21:58:51,337 INFO L858 garLoopResultBuilder]: For program point input_set_abs_paramsFINAL(lines 4226 4228) no Hoare annotation was computed. [2021-12-06 21:58:51,337 INFO L858 garLoopResultBuilder]: For program point kbtab_exitFINAL(lines 3928 3936) no Hoare annotation was computed. [2021-12-06 21:58:51,337 INFO L861 garLoopResultBuilder]: At program point L4250(lines 4249 4251) the Hoare annotation is: true [2021-12-06 21:58:51,337 INFO L861 garLoopResultBuilder]: At program point kbtab_exitENTRY(lines 3928 3936) the Hoare annotation is: true [2021-12-06 21:58:51,337 INFO L858 garLoopResultBuilder]: For program point kbtab_exitEXIT(lines 3928 3936) no Hoare annotation was computed. [2021-12-06 21:58:51,337 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-12-06 21:58:51,338 INFO L858 garLoopResultBuilder]: For program point L4203(line 4203) no Hoare annotation was computed. [2021-12-06 21:58:51,338 INFO L858 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 4201 4205) no Hoare annotation was computed. [2021-12-06 21:58:51,338 INFO L858 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 4201 4205) no Hoare annotation was computed. [2021-12-06 21:58:51,338 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-12-06 21:58:51,338 INFO L858 garLoopResultBuilder]: For program point L4207-1(line 4207) no Hoare annotation was computed. [2021-12-06 21:58:51,338 INFO L861 garLoopResultBuilder]: At program point L4207-2(lines 4206 4208) the Hoare annotation is: true [2021-12-06 21:58:51,338 INFO L858 garLoopResultBuilder]: For program point kzallocEXIT(lines 3405 3413) no Hoare annotation was computed. [2021-12-06 21:58:51,338 INFO L861 garLoopResultBuilder]: At program point L3401(lines 3394 3403) the Hoare annotation is: true [2021-12-06 21:58:51,338 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-12-06 21:58:51,338 INFO L858 garLoopResultBuilder]: For program point kzallocFINAL(lines 3405 3413) no Hoare annotation was computed. [2021-12-06 21:58:51,339 INFO L861 garLoopResultBuilder]: At program point ldv_assume_stopENTRY(lines 4055 4061) the Hoare annotation is: true [2021-12-06 21:58:51,339 INFO L858 garLoopResultBuilder]: For program point ldv_assume_stopEXIT(lines 4055 4061) no Hoare annotation was computed. [2021-12-06 21:58:51,339 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-12-06 21:58:51,339 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-12-06 21:58:51,339 INFO L858 garLoopResultBuilder]: For program point L4109-1(lines 4106 4111) no Hoare annotation was computed. [2021-12-06 21:58:51,339 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-12-06 21:58:51,339 INFO L858 garLoopResultBuilder]: For program point usb_free_coherentEXIT(lines 4093 4122) no Hoare annotation was computed. [2021-12-06 21:58:51,339 INFO L861 garLoopResultBuilder]: At program point L4101(line 4101) the Hoare annotation is: true [2021-12-06 21:58:51,339 INFO L858 garLoopResultBuilder]: For program point L4099(lines 4097 4116) no Hoare annotation was computed. [2021-12-06 21:58:51,340 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-12-06 21:58:51,340 INFO L858 garLoopResultBuilder]: For program point L4106(lines 4106 4111) no Hoare annotation was computed. [2021-12-06 21:58:51,340 INFO L858 garLoopResultBuilder]: For program point L4098(lines 4097 4116) no Hoare annotation was computed. [2021-12-06 21:58:51,340 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-12-06 21:58:51,340 INFO L858 garLoopResultBuilder]: For program point L3487(lines 3487 3494) no Hoare annotation was computed. [2021-12-06 21:58:51,340 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 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (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) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) .cse1 .cse2))) [2021-12-06 21:58:51,340 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) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-06 21:58:51,340 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|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2021-12-06 21:58:51,340 INFO L858 garLoopResultBuilder]: For program point L3851(lines 3851 3854) no Hoare annotation was computed. [2021-12-06 21:58:51,341 INFO L858 garLoopResultBuilder]: For program point L3884-1(line 3884) no Hoare annotation was computed. [2021-12-06 21:58:51,341 INFO L858 garLoopResultBuilder]: For program point L4132(line 4132) no Hoare annotation was computed. [2021-12-06 21:58:51,341 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-06 21:58:51,341 INFO L858 garLoopResultBuilder]: For program point L3802(lines 3802 3808) no Hoare annotation was computed. [2021-12-06 21:58:51,341 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) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) [2021-12-06 21:58:51,341 INFO L858 garLoopResultBuilder]: For program point L3885-1(line 3885) no Hoare annotation was computed. [2021-12-06 21:58:51,341 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|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 1)) [2021-12-06 21:58:51,341 INFO L858 garLoopResultBuilder]: For program point L3456(lines 3456 3460) no Hoare annotation was computed. [2021-12-06 21:58:51,341 INFO L858 garLoopResultBuilder]: For program point L3456-2(lines 3456 3460) no Hoare annotation was computed. [2021-12-06 21:58:51,341 INFO L858 garLoopResultBuilder]: For program point L3985(lines 3985 3990) no Hoare annotation was computed. [2021-12-06 21:58:51,342 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|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0)) [2021-12-06 21:58:51,342 INFO L858 garLoopResultBuilder]: For program point L3820(lines 3820 3823) no Hoare annotation was computed. [2021-12-06 21:58:51,342 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|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0)) [2021-12-06 21:58:51,342 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)) (.cse6 (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) (.cse5 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 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 .cse5 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) .cse2 .cse6) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse3 (not .cse6) .cse5 .cse1 .cse2 (not .cse4)))) [2021-12-06 21:58:51,342 INFO L858 garLoopResultBuilder]: For program point L3490(lines 3490 3494) no Hoare annotation was computed. [2021-12-06 21:58:51,342 INFO L858 garLoopResultBuilder]: For program point L3490-2(lines 3487 3494) no Hoare annotation was computed. [2021-12-06 21:58:51,342 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 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (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) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) .cse1 .cse2))) [2021-12-06 21:58:51,342 INFO L858 garLoopResultBuilder]: For program point L3870-1(line 3870) no Hoare annotation was computed. [2021-12-06 21:58:51,342 INFO L858 garLoopResultBuilder]: For program point L4184(lines 4184 4189) no Hoare annotation was computed. [2021-12-06 21:58:51,343 INFO L858 garLoopResultBuilder]: For program point L4135(lines 4135 4138) no Hoare annotation was computed. [2021-12-06 21:58:51,343 INFO L858 garLoopResultBuilder]: For program point L3805(lines 3805 3808) no Hoare annotation was computed. [2021-12-06 21:58:51,343 INFO L858 garLoopResultBuilder]: For program point L4086(lines 4071 4087) no Hoare annotation was computed. [2021-12-06 21:58:51,343 INFO L858 garLoopResultBuilder]: For program point L3987-1(lines 3985 3990) no Hoare annotation was computed. [2021-12-06 21:58:51,343 INFO L858 garLoopResultBuilder]: For program point L3987(lines 3987 3990) no Hoare annotation was computed. [2021-12-06 21:58:51,343 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-12-06 21:58:51,343 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|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2021-12-06 21:58:51,343 INFO L854 garLoopResultBuilder]: At program point L3872(lines 3782 3874) the Hoare annotation is: (let ((.cse5 (= ~ldv_coherent_state~0 0)) (.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0)) (.cse4 (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse6 (= ~ldv_urb_state~0 0)) (.cse3 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 .cse1 .cse2 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) .cse3 .cse4) (and .cse5 .cse6 (<= (+ |ULTIMATE.start_kbtab_probe_#res#1| 12) 0) .cse3 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse5 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse0 .cse1 (not .cse4) .cse2 .cse6 .cse3))) [2021-12-06 21:58:51,343 INFO L858 garLoopResultBuilder]: For program point L3426-1(line 3426) no Hoare annotation was computed. [2021-12-06 21:58:51,344 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) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-06 21:58:51,344 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) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-06 21:58:51,344 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) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-06 21:58:51,344 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) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) [2021-12-06 21:58:51,344 INFO L858 garLoopResultBuilder]: For program point L3856-1(line 3856) no Hoare annotation was computed. [2021-12-06 21:58:51,344 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-12-06 21:58:51,344 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-12-06 21:58:51,344 INFO L858 garLoopResultBuilder]: For program point L3972-1(line 3972) no Hoare annotation was computed. [2021-12-06 21:58:51,344 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) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-06 21:58:51,345 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-06 21:58:51,345 INFO L858 garLoopResultBuilder]: For program point L4187-1(lines 4183 4197) no Hoare annotation was computed. [2021-12-06 21:58:51,345 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 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (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) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) .cse1 .cse2))) [2021-12-06 21:58:51,345 INFO L854 garLoopResultBuilder]: At program point L4187(line 4187) the Hoare annotation is: false [2021-12-06 21:58:51,345 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) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-06 21:58:51,345 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-12-06 21:58:51,345 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|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2021-12-06 21:58:51,345 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) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-06 21:58:51,345 INFO L858 garLoopResultBuilder]: For program point L3841(line 3841) no Hoare annotation was computed. [2021-12-06 21:58:51,346 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-12-06 21:58:51,346 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-12-06 21:58:51,346 INFO L858 garLoopResultBuilder]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2021-12-06 21:58:51,346 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-12-06 21:58:51,346 INFO L858 garLoopResultBuilder]: For program point L3529-1(line 3529) no Hoare annotation was computed. [2021-12-06 21:58:51,346 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) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-06 21:58:51,346 INFO L858 garLoopResultBuilder]: For program point L4008(lines 4008 4011) no Hoare annotation was computed. [2021-12-06 21:58:51,346 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) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-06 21:58:51,346 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-06 21:58:51,347 INFO L858 garLoopResultBuilder]: For program point L3513-1(line 3513) no Hoare annotation was computed. [2021-12-06 21:58:51,347 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-12-06 21:58:51,347 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-12-06 21:58:51,347 INFO L858 garLoopResultBuilder]: For program point L4075(line 4075) no Hoare annotation was computed. [2021-12-06 21:58:51,347 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) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-06 21:58:51,347 INFO L858 garLoopResultBuilder]: For program point L3861-1(line 3861) no Hoare annotation was computed. [2021-12-06 21:58:51,347 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) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) [2021-12-06 21:58:51,347 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) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2021-12-06 21:58:51,347 INFO L854 garLoopResultBuilder]: At program point L4043(lines 3961 4045) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2021-12-06 21:58:51,348 INFO L858 garLoopResultBuilder]: For program point L3994(lines 3994 4030) no Hoare annotation was computed. [2021-12-06 21:58:51,348 INFO L858 garLoopResultBuilder]: For program point L4143(lines 4128 4144) no Hoare annotation was computed. [2021-12-06 21:58:51,348 INFO L858 garLoopResultBuilder]: For program point L3813(lines 3813 3816) no Hoare annotation was computed. [2021-12-06 21:58:51,348 INFO L854 garLoopResultBuilder]: At program point L4193-1(lines 4181 4198) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2021-12-06 21:58:51,348 INFO L854 garLoopResultBuilder]: At program point L4193(line 4193) the Hoare annotation is: false [2021-12-06 21:58:51,348 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)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0))) (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 .cse0 .cse1 .cse2 .cse3 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 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)))) [2021-12-06 21:58:51,348 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)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0))) (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 .cse0 .cse1 .cse2 .cse3 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 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)))) [2021-12-06 21:58:51,348 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 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= ~ldv_coherent_state~0 1)) (.cse4 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse5 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)))) (or (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .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))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)))) [2021-12-06 21:58:51,348 INFO L858 garLoopResultBuilder]: For program point L4078(lines 4078 4081) no Hoare annotation was computed. [2021-12-06 21:58:51,348 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-06 21:58:51,348 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-12-06 21:58:51,348 INFO L858 garLoopResultBuilder]: For program point L3798-1(line 3798) no Hoare annotation was computed. [2021-12-06 21:58:51,349 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-12-06 21:58:51,349 INFO L858 garLoopResultBuilder]: For program point L3997(lines 3997 4030) no Hoare annotation was computed. [2021-12-06 21:58:51,349 INFO L858 garLoopResultBuilder]: For program point L3865-1(line 3865) no Hoare annotation was computed. [2021-12-06 21:58:51,349 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 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= ~ldv_coherent_state~0 1)) (.cse4 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse5 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)))) (or (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 .cse3 .cse4 .cse5) (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 .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))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)))) [2021-12-06 21:58:51,349 INFO L854 garLoopResultBuilder]: At program point L4146(lines 4124 4148) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse7 (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (.cse8 (= ~ldv_coherent_state~0 1)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse3 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) (.cse6 (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)))) (.cse5 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0))) (or (and (let ((.cse4 (not .cse7))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5))) (= 0 ~res_kbtab_probe_3~0) .cse8 (= ~ldv_urb_state~0 1)) (and .cse0 .cse1 .cse7 (= ~ldv_urb_state~0 0) .cse8 .cse2 .cse3 .cse6 .cse5 (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)))) [2021-12-06 21:58:51,349 INFO L858 garLoopResultBuilder]: For program point L3981(line 3981) no Hoare annotation was computed. [2021-12-06 21:58:51,349 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|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2021-12-06 21:58:51,349 INFO L858 garLoopResultBuilder]: For program point L3882-1(line 3882) no Hoare annotation was computed. [2021-12-06 21:58:51,350 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-12-06 21:58:51,350 INFO L854 garLoopResultBuilder]: At program point L3998(lines 3997 4030) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0)) (.cse4 (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| |ULTIMATE.start_main_~tmp___8~3#1|)))) (or (and .cse0 (<= 0 ~ldv_coherent_state~0) .cse1 .cse2 .cse3 .cse4 (<= 0 ~ldv_urb_state~0) (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) (and (= ~ldv_coherent_state~0 0) .cse1 .cse4 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)))) [2021-12-06 21:58:51,350 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|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2021-12-06 21:58:51,350 INFO L861 garLoopResultBuilder]: At program point ldv_blast_assertENTRY(lines 4046 4051) the Hoare annotation is: true [2021-12-06 21:58:51,350 INFO L858 garLoopResultBuilder]: For program point ldv_blast_assertEXIT(lines 4046 4051) no Hoare annotation was computed. [2021-12-06 21:58:51,350 INFO L858 garLoopResultBuilder]: For program point ldv_blast_assertFINAL(lines 4046 4051) no Hoare annotation was computed. [2021-12-06 21:58:51,350 INFO L858 garLoopResultBuilder]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2021-12-06 21:58:51,350 INFO L858 garLoopResultBuilder]: For program point dev_set_drvdataFINAL(lines 4213 4215) no Hoare annotation was computed. [2021-12-06 21:58:51,350 INFO L858 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 4213 4215) no Hoare annotation was computed. [2021-12-06 21:58:51,351 INFO L861 garLoopResultBuilder]: At program point dev_set_drvdataENTRY(lines 4213 4215) the Hoare annotation is: true [2021-12-06 21:58:51,353 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-12-06 21:58:51,354 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 21:58:51,373 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-06 21:58:51,374 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-06 21:58:51,375 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-06 21:58:51,375 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-06 21:58:51,380 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-06 21:58:51,380 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-06 21:58:51,381 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-06 21:58:51,381 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-06 21:58:51,382 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-06 21:58:51,382 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-06 21:58:51,382 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-06 21:58:51,383 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-06 21:58:51,383 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-06 21:58:51,384 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-06 21:58:51,384 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-06 21:58:51,384 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-06 21:58:51,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 09:58:51 BoogieIcfgContainer [2021-12-06 21:58:51,390 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 21:58:51,390 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 21:58:51,390 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 21:58:51,390 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 21:58:51,390 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 09:57:57" (3/4) ... [2021-12-06 21:58:51,393 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-06 21:58:51,397 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_init [2021-12-06 21:58:51,398 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_get_drvdata [2021-12-06 21:58:51,398 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2021-12-06 21:58:51,398 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2021-12-06 21:58:51,398 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2021-12-06 21:58:51,398 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2021-12-06 21:58:51,398 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_abs_params [2021-12-06 21:58:51,398 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_exit [2021-12-06 21:58:51,398 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2021-12-06 21:58:51,398 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2021-12-06 21:58:51,398 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2021-12-06 21:58:51,398 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2021-12-06 21:58:51,398 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2021-12-06 21:58:51,398 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2021-12-06 21:58:51,410 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 73 nodes and edges [2021-12-06 21:58:51,411 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2021-12-06 21:58:51,413 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2021-12-06 21:58:51,414 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-06 21:58:51,415 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-06 21:58:51,436 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-12-06 21:58:51,436 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-12-06 21:58:51,437 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(error == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) || (((((((arbitrary_memory == 0 && 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) [2021-12-06 21:58:51,437 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-12-06 21:58:51,437 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || ((((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0)) || (((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) [2021-12-06 21:58:51,438 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) && arbitrary_memory == 0) && 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)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(0 == res_kbtab_probe_3)) [2021-12-06 21:58:51,438 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-12-06 21:58:51,439 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((arbitrary_memory == 0 && arbitrary_memory == 0) && !(arbitrary_memory == 0)) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0)) && 0 == res_kbtab_probe_3) && ldv_coherent_state == 1) && ldv_urb_state == 1) || (((((((((arbitrary_memory == 0 && 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) [2021-12-06 21:58:51,439 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2021-12-06 21:58:51,439 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-12-06 21:58:51,439 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-12-06 21:58:51,440 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2021-12-06 21:58:51,440 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2021-12-06 21:58:51,440 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2021-12-06 21:58:51,440 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2021-12-06 21:58:51,440 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2021-12-06 21:58:51,441 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2021-12-06 21:58:51,441 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(error == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0) [2021-12-06 21:58:51,580 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 21:58:51,580 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 21:58:51,580 INFO L158 Benchmark]: Toolchain (without parser) took 55860.94ms. Allocated memory was 134.2MB in the beginning and 778.0MB in the end (delta: 643.8MB). Free memory was 86.8MB in the beginning and 481.1MB in the end (delta: -394.3MB). Peak memory consumption was 250.4MB. Max. memory is 16.1GB. [2021-12-06 21:58:51,580 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 109.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 21:58:51,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 718.84ms. Allocated memory is still 134.2MB. Free memory was 86.6MB in the beginning and 99.7MB in the end (delta: -13.1MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2021-12-06 21:58:51,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.80ms. Allocated memory is still 134.2MB. Free memory was 99.7MB in the beginning and 94.4MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 21:58:51,581 INFO L158 Benchmark]: Boogie Preprocessor took 59.18ms. Allocated memory is still 134.2MB. Free memory was 94.4MB in the beginning and 89.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-06 21:58:51,581 INFO L158 Benchmark]: RCFGBuilder took 837.28ms. Allocated memory was 134.2MB in the beginning and 213.9MB in the end (delta: 79.7MB). Free memory was 89.2MB in the beginning and 113.9MB in the end (delta: -24.7MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2021-12-06 21:58:51,581 INFO L158 Benchmark]: TraceAbstraction took 53965.65ms. Allocated memory was 213.9MB in the beginning and 778.0MB in the end (delta: 564.1MB). Free memory was 112.8MB in the beginning and 544.0MB in the end (delta: -431.2MB). Peak memory consumption was 423.4MB. Max. memory is 16.1GB. [2021-12-06 21:58:51,582 INFO L158 Benchmark]: Witness Printer took 189.95ms. Allocated memory is still 778.0MB. Free memory was 544.0MB in the beginning and 481.1MB in the end (delta: 62.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2021-12-06 21:58:51,583 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.14ms. Allocated memory is still 134.2MB. Free memory is still 109.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 718.84ms. Allocated memory is still 134.2MB. Free memory was 86.6MB in the beginning and 99.7MB in the end (delta: -13.1MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.80ms. Allocated memory is still 134.2MB. Free memory was 99.7MB in the beginning and 94.4MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.18ms. Allocated memory is still 134.2MB. Free memory was 94.4MB in the beginning and 89.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 837.28ms. Allocated memory was 134.2MB in the beginning and 213.9MB in the end (delta: 79.7MB). Free memory was 89.2MB in the beginning and 113.9MB in the end (delta: -24.7MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. * TraceAbstraction took 53965.65ms. Allocated memory was 213.9MB in the beginning and 778.0MB in the end (delta: 564.1MB). Free memory was 112.8MB in the beginning and 544.0MB in the end (delta: -431.2MB). Peak memory consumption was 423.4MB. Max. memory is 16.1GB. * Witness Printer took 189.95ms. Allocated memory is still 778.0MB. Free memory was 544.0MB in the beginning and 481.1MB in the end (delta: 62.9MB). 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: 53.9s, OverallIterations: 23, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 31.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2901 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2799 mSDsluCounter, 19954 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 238 IncrementalHoareTripleChecker+Unchecked, 14936 mSDsCounter, 481 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1848 IncrementalHoareTripleChecker+Invalid, 2567 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 481 mSolverCounterUnsat, 5018 mSDtfsCounter, 1848 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3038 GetRequests, 2746 SyntacticMatches, 4 SemanticMatches, 288 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1210occurred in iteration=13, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 1456 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 81 LocationsWithAnnotation, 3470 PreInvPairs, 3685 NumberOfFragments, 1942 HoareAnnotationTreeSize, 3470 FomulaSimplifications, 377633 FormulaSimplificationTreeSizeReduction, 21.0s HoareSimplificationTime, 81 FomulaSimplificationsInter, 269944 FormulaSimplificationTreeSizeReductionInter, 10.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 4605 NumberOfCodeBlocks, 4503 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 4671 ConstructedInterpolants, 8 QuantifiedInterpolants, 9774 SizeOfPredicates, 86 NumberOfNonLiveVariables, 27892 ConjunctsInSsa, 320 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) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || ((((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0)) || (((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4072]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0 - InvariantResult [Line: 3512]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0 - InvariantResult [Line: 3449]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3465]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4181]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 4229]: Loop Invariant Derived loop invariant: ((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1 - InvariantResult [Line: 3525]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4256]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3422]: Loop Invariant Derived loop invariant: ((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && 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) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0) - InvariantResult [Line: 4097]: Loop Invariant Derived loop invariant: (!(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) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3793]: Loop Invariant [2021-12-06 21:58:51,590 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-06 21:58:51,590 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-06 21:58:51,590 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-06 21:58:51,590 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((!(error == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) || (((((((arbitrary_memory == 0 && 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) - 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) && arbitrary_memory == 0) && 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) && arbitrary_memory == 0) && 0 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4249]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3961]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 3980]: Loop Invariant Derived loop invariant: (((((((arbitrary_memory == 0 && 0 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && 0 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4129]: Loop Invariant [2021-12-06 21:58:51,592 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-06 21:58:51,592 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-06 21:58:51,592 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-06 21:58:51,592 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) && arbitrary_memory == 0) && 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)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(0 == res_kbtab_probe_3)) - InvariantResult [Line: 4124]: Loop Invariant [2021-12-06 21:58:51,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-06 21:58:51,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-06 21:58:51,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-06 21:58:51,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-06 21:58:51,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-06 21:58:51,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-12-06 21:58:51,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-12-06 21:58:51,593 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 && arbitrary_memory == 0) && !(arbitrary_memory == 0)) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0)) && 0 == res_kbtab_probe_3) && ldv_coherent_state == 1) && ldv_urb_state == 1) || (((((((((arbitrary_memory == 0 && 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) - InvariantResult [Line: 4219]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 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) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 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 && ldv_urb_state == 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) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 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) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4154]: Loop Invariant Derived loop invariant: ((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) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4235]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0 - InvariantResult [Line: 3506]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3569]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3979]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3911]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3997]: Loop Invariant Derived loop invariant: ((((((((arbitrary_memory == 0 && 0 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 0 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 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) RESULT: Ultimate proved your program to be correct! [2021-12-06 21:58:51,646 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_daa4a2ef-d0e0-4625-9b28-ab4f4473dcfa/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE